See this document in CiteSeerX!

Using Simple Page Placement Policies to Reduce the Cost of Cache Fills in Coherent Shared-Memory Systems (1994)  (Make Corrections)  (29 citations)
Michael Marchetti, Leonidas Kontothanassis, Ricardo Bianchini, Michael L. Scott



  Home/Search   Context   Related

 
View or download:
rochester.edu/pub/...ge_placement.ps.gz
rochester.edu/syst..._cache_fills.ps.gz
rochester.edu/pub/..._cache_fills.ps.gz
Cached:  PS.gz  PS  PDF   Image  Update  Help

From:  rochester.edu (more)
From:  rochester.edu
(Enter author homepages)

Rate this article: (best)
  Comment on this article  
(Enter summary)

Abstract: The cost of a cache miss depends heavily on the location of the main memory that backs the missing line. For certain applications, this cost is a major factor in overall performance. We report on the utility of OS-based page placement as a mechanism to increase the frequency with which cache fills access local memory in distributed shared memory multiprocessors. Even with the very simple policy of first-use placement, we find significant improvements over round-robin placement for many... (Update)

Context of citations to this paper:   More

...locations. 2.3. 5 CSM MS Mg and CSM None Mg: Home Node Migration All of the above protocol variants use first touch home node assignment [18]. Home assignment is extremely important because processors on the home node write directly to master copy and so do not incur costly twin...

.... for achieving satisfactory data locality at the page level with page placement schemes implemented entirely in the operating system [15, 16]. However, the memory access traces of parallel programs do not and can not always conform to the memory management strategy of the...

Cited by:   More
Evaluation of the Memory Page Migration Influence in.. - Corbalan, Martorell.. (2002)   (Correct)
Clustered Objects: Initial Design, Implementation and Evaluation - Appavoo   (Correct)
Eliminating Useless Messages in Write-Update Protocols .. - Bianchini, LeBlanc.. (1994)   (Correct)

Similar documents (at the sentence level):
69.2%:   Using Simple Page Placement Policies to Reduce the Cost of.. - Michael Marchetti (1994)   (Correct)

Active bibliography (related documents):   More   All
0.1:   Memory Models - Kontothanassis, Scott (1996)   (Correct)
0.1:   Using Memory-Mapped Network Interfaces to Improve the.. - Kontothanassis, Scott (1996)   (Correct)
0.1:   Efficient Shared Memory with Minimal Hardware Support - Kontothanassis, Scott   (Correct)

Similar documents based on text:   More   All
0.1:   Extensions of Fill's algorithm for perfect simulation - Møller, Schladitz (1998)   (Correct)
0.1:   Extension of Fill's perfect rejection sampling.. - Fill, Machida.. (2000)   (Correct)
0.1:   An extension of Fill's exact sampling algorithm to.. - Murdoch, Rosenthal (1998)   (Correct)

Related documents from co-citation:   More   All
14:   Operating System Support for Improving Data Locality on CC-NUMA Compute Servers (context) - Verghese, Devine et al. - 1996
14:   SPLASH: Stanford parallel applications for shared memory (context) - Singh, Weber et al. - 1992
12:   Virtual memory mapped network interface for the SHRIMP multicomputer - Blumrich - 1994

BibTeX entry:   (Update)

M. Marchetti, L. I. Kontothanassis, R. Bianchini, and M. L. Scott, "Using Simple Page Placement Policies to Reduce the Cost of Cache Fills in Coherent Shared-Memory Systems," Technical Report 535, Department of Computer Science, University of Rochester, September 1994. http://citeseer.ist.psu.edu/marchetti94using.html   More

@techreport{ marchetti94using,
    author = "Michael Marchetti and Leonidas Kontothanassis and Ricardo Bianchini and Michael L. Scott",
    title = "Using Simple Page Placement Policies to Reduce the Cost of Cache Fills in Coherent Shared-Memory Systems",
    number = "TR535",
    year = "1994",
    url = "citeseer.ist.psu.edu/marchetti94using.html" }
Citations (may not include all citations):
496   SPLASH: Stanford Parallel Applications for Shared-Memory (context) - Singh, Weber et al. - 1992
300   Lazy Release Consistency for Software Distributed Shared Mem.. - Keleher, Cox et al. - 1992
217   NASA Ames Research Center (context) - Bailey, Barton et al. - 1991
212   The MIT Alewife Machine: Architecture and Performance - Agarwal - 1995
145   DDM --- A CacheOnly Memory Architecture - Hagersten, Landin et al. - 1992
142   MINT: A Front End for Efficient Simulation of Shared-Memory .. - Veenstra, Fowler - 1994
94   The DASH Prototype: Logic Overhead and Performance - Lenoski, Laudon et al. - 1993
94   Run-Time Parallelization and Scheduling of Loops (context) - Saltz, Mirchandaney et al. - 1991
87   The Implementation of a Coherent Memory Abstraction on a NUM.. (context) - Cox, Fowler - 1989
71   Comparative Performance Evaluation of Cache-Coherent NUMA an.. (context) - Stenstrom, Joe et al. - 1992
61   Experimental Comparison of Memory Management Policies for NU.. - Jr, Ellis - 1991
60   Scheduling and Page Migration for Multiprocessor Compute Ser.. - Chandra, Devine et al. - 1994
44   NUMA Policies and Their Relation to Memory Architecture (context) - Bolosky, Scott et al. - 1991
34   Scalable Coherent Interface (context) - James, Laundrie et al. - 1990
28   IEEE Parallel and Distributed Technology (context) - Loveman, Fortran - 1993
10   Software Cache Coherence for Large Scale Multiprocessors - Kontothanassis, Scott - 1995



The graph only includes citing articles where the year of publication is known.


Documents on the same site (http://fermivista.math.jussieu.fr/ftp/ftp.cs.rochester.edu.html):   More
A Downward Translation in the Polynomial Hierarchy - Hemaspaandra, Hemaspaandra.. (1997)   (Correct)
Software Cache Coherence for Large Scale Multiprocessors - Kontothanassis, Scott (1994)   (Correct)
On-line Estimation of Visual-Motor Models for Robot Control and.. - Jägersand   (Correct)

Online articles have much greater impact   More about CiteSeer.IST   Add search form to your site   Submit documents   Feedback  

CiteSeer.IST - Copyright Penn State and NEC