<link rel="stylesheet" href="styles.cf390c6bfbe7555f.css"> Skip to main content

Effective mechanisms to reduce the overhead of migratory sharing for linked-based cache coherence protocols in clustering multiprocessor architecture

dc.citation.epage518en_US
dc.citation.spage511en_US
dc.contributor.authorPean, DLen_US
dc.contributor.authorWu, JRen_US
dc.contributor.authorChen, Cen_US
dc.contributor.department資訊工程學系zh_TW
dc.contributor.departmentDepartment of Computer Scienceen_US
dc.date.accessioned2014-12-08T15:27:20Z
dc.date.available2014-12-08T15:27:20Z
dc.date.issued1998en_US
dc.description.abstractMigratory-sharing data references will incur many cache misses that can be reduced by merging the invalidation/update requests and the cache misses. This paper presents effective software and hardware techniques to reduce the overhead of migratory-sharing references for the linked-based cache coherence protocols. The software scheme combines both compiler labeling and run time detection techniques. The hardware scheme uses the special access patterns in the linked-based protocols to detect migratory data objects. We have evaluated the performance on the linked-based program-driven simulation environment by using a set of SPLASH benchmarks. According to the simulation results, our software and hm du are methods effectively enhanced the system performance up to 29% and 23% respectively by reducing the overhead of the migratory-sharing references.en_US
dc.identifier.isbn0-8186-8603-0en_US
dc.identifier.journal1998 INTERNATIONAL CONFERENCE ON PARALLEL AND DISTRIBUTED SYSTEMS, PROCEEDINGSen_US
dc.identifier.urihttps://ir.lib.nycu.edu.tw/handle/11536/19599
dc.identifier.wosnumberWOS:000078318400063
dc.language.isoen_USen_US
dc.titleEffective mechanisms to reduce the overhead of migratory sharing for linked-based cache coherence protocols in clustering multiprocessor architectureen_US
dc.typeProceedings Paperen_US

Files

License bundle

Now showing 1 - 1 of 1
Loading...
Thumbnail Image
Name:
license.txt
Size:
1.71 KB
Format:
Item-specific license agreed to upon submission
Description: