Sciweavers

331 search results - page 42 / 67
» A Parallel Algorithm for Compile-Time Scheduling of Parallel...
Sort
View
SPAA
2003
ACM
14 years 27 days ago
The complexity of verifying memory coherence
The general problem of verifying coherence for shared-memory multiprocessor executions is NP-Complete. Verifying memory consistency models is therefore NP-Hard, because memory con...
Jason F. Cantin, Mikko H. Lipasti, James E. Smith
CC
2008
Springer
193views System Software» more  CC 2008»
13 years 9 months ago
Automatic Transformations for Communication-Minimized Parallelization and Locality Optimization in the Polyhedral Model
The polyhedral model provides powerful abstractions to optimize loop nests with regular accesses. Affine transformations in this model capture a complex sequence of execution-reord...
Uday Bondhugula, Muthu Manikandan Baskaran, Sriram...
ICPADS
2005
IEEE
14 years 1 months ago
Minimizing Energy via Loop Scheduling and DVS for Multi-Core Embedded Systems
Low energy consumptions are extremely important in real-time embedded systems, and scheduling is one of the techniques used to obtain lower energy consumptions. In this paper, we ...
Ying Chen, Zili Shao, Qingfeng Zhuge, Chun Xue, Bi...
IPPS
2006
IEEE
14 years 1 months ago
Loosely-coupled loop scheduling in computational grids
Loop distribution is one of the most useful techniques to reduce the execution time of parallel applications. Traditionally, loop scheduling algorithms are implemented based on pa...
Jose Herrera, Eduardo Huedo, Rubén S. Monte...
COORDINATION
2009
Springer
14 years 8 months ago
Multicore Scheduling for Lightweight Communicating Processes
Process-oriented programming is a design methodology in which software applications are constructed from communicating concurrent processes. A process-oriented design is typically ...
Carl G. Ritson, Adam T. Sampson, Fred R. M. Barnes