Loading...
Please wait, while we are loading the content...
Similar Documents
An experimental comparison of scheduling policies on coarse-grain multiprocessors (1995).
| Content Provider | CiteSeerX |
|---|---|
| Author | Connelly, Christopher |
| Abstract | Scalable shared memory multiprocessors commonly employ replication and the associated coherency maintenance of memory blocks, but differ in the granularity from fine-grain (e.g. cache-coherent multiprocessors) to coarse-grain (e.g. page-based distributed shared memory systems). Regardless of the size of coherency blocks, attaining good performance may depend on the number of copies of cached data staying small, due to the inability of current architectures to support widely shared, writable data. Previous workload characterization studies of fine-grain systems have shown sharing patterns that tend toward small worker sets. Coarse-grain architectures offer scalability advantages unless sharing patterns for larger blocks are considerably less favorable. In the first portion of this dissertation, we investigate data sharing patterns in coarse-grain multiprocessors. Our results are encouraging in that, despite the coarse granularity, worker sets scale reasonably. This has implications for ... |
| File Format | |
| Publisher Date | 1995-01-01 |
| Access Restriction | Open |
| Subject Keyword | Coarse-grain Multiprocessor Scheduling Policy Experimental Comparison Memory Multiprocessor Coarse Granularity Cache-coherent Multiprocessor Worker Set Memory System Memory Block Good Performance Fine-grain System Writable Data Small Worker Set Current Architecture Previous Workload Characterization Study Scalability Advantage First Portion Coarse-grain Architecture Coherency Block Associated Coherency Maintenance |
| Content Type | Text |
