Sciweavers

201 search results - page 6 / 41
» Estimating the Parallel Start-Up Overhead for Parallelizing ...
Sort
View
IRREGULAR
1995
Springer
13 years 11 months ago
Run-Time Techniques for Parallelizing Sparse Matrix Problems
Sparse matrix problems are di cult to parallelize e ciently on message-passing machines, since they access data through multiple levels of indirection. Inspector executor strategie...
Manuel Ujaldon, Shamik D. Sharma, Joel H. Saltz, E...
PDPTA
1996
13 years 8 months ago
Exploiting Task-Level Parallelism Using pTask
This paper presents pTask-- a system that allows users to automatically exploit dynamic task-level parallelism in sequential array-based C programs. The system employs compiler an...
Tarek S. Abdelrahman, Sum Huynh
POPL
1997
ACM
13 years 11 months ago
Synchronization Transformations for Parallel Computing
As parallel machines become part of the mainstream computing environment, compilers will need to apply synchronization optimizations to deliver e cient parallel software. This pap...
Pedro C. Diniz, Martin C. Rinard
IPPS
1999
IEEE
13 years 11 months ago
Run-Time Selection of Block Size in Pipelined Parallel Programs
Parallelizing compiler technology has improved in recent years. One area in which compilers have made progress is in handling DOACROSS loops, where crossprocessor data dependencie...
David K. Lowenthal, Michael James
ISPAN
2005
IEEE
14 years 1 months ago
Dynamic Estimation of Task Level Parallelism with Operating System Support
The amount of Task Level Parallelism (TLP) in runtime workload is useful information to determine the efficient usage of multiprocessors. This paper presents mechanisms to dynami...
Luong Dinh Hung, Shuichi Sakai