Sciweavers

314 search results - page 1 / 63
» Reducing Parallel Overheads Through Dynamic Serialization
Sort
View
IPPS
1999
IEEE
13 years 8 months ago
Reducing Parallel Overheads Through Dynamic Serialization
If parallelism can be successfully exploited in a program, significant reductions in execution time can be achieved. However, if sections of the code are dominated by parallel ove...
Michael Voss, Rudolf Eigenmann
LCPC
1997
Springer
13 years 8 months ago
Reducing Synchronization Overhead for Compiler-Parallelized Codes
Software distributed-shared-memory (DSM) systems providean appealingtarget for parallelizing compilers due to their flexibility. Previous studies demonstrate such systems can prov...
Hwansoo Han, Chau-Wen Tseng, Peter J. Keleher
VLSID
2006
IEEE
136views VLSI» more  VLSID 2006»
14 years 4 months ago
Improved Data Compression for Serial Interconnected Network on Chip through Unused Significant Bit Removal
Serial links in network on chip provide advantages in terms of reduced wiring area, reduced switch complexity and power. However, serial links offer lower bandwidth in comparison ...
Simon Ogg, Bashir M. Al-Hashimi
IPPS
1999
IEEE
13 years 8 months ago
Reducing System Overheads in Home-based Software DSMs
Software DSM systems su er from the high communication and coherence-induced overheads that limit performance. This paper introduces our e orts in reducing system overheads of a h...
Weiwu Hu, Weisong Shi, Zhimin Tang
PPOPP
2009
ACM
14 years 5 months ago
Serialization sets: a dynamic dependence-based parallel execution model
This paper proposes a new parallel execution model where programmers augment a sequential program with pieces of code called serializers that dynamically map computational operati...
Matthew D. Allen, Srinath Sridharan, Gurindar S. S...