Sciweavers

206 search results - page 32 / 42
» Parallel Job Scheduling with Overhead: A Benchmark Study
Sort
View
CF
2007
ACM
13 years 11 months ago
Identifying potential parallelism via loop-centric profiling
The transition to multithreaded, multi-core designs places a greater responsibility on programmers and software for improving performance; thread-level parallelism (TLP) will be i...
Tipp Moseley, Daniel A. Connors, Dirk Grunwald, Ra...
FCCM
2002
IEEE
127views VLSI» more  FCCM 2002»
14 years 16 days ago
Hardware-Assisted Fast Routing
To fully realize the benefits of partial and rapid reconfiguration of field-programmable devices, we often need to dynamically schedule computing tasks and generate instance-sp...
André DeHon, Randy Huang, John Wawrzynek
GCC
2005
Springer
14 years 1 months ago
An Efficient Network Information Model Using NWS for Grid Computing Environments
Grid computing technologies enable large-scale aggregation and sharing of resources via wide-area networks focused on sharing computational, data, and other resources to form gener...
Chao-Tung Yang, Po-Chi Shih, Sung-Yi Chen, Wen-Chu...
ASPLOS
2006
ACM
13 years 11 months ago
Accurate and efficient filtering for the Intel thread checker race detector
Debugging data races in parallel applications is a difficult task. Error-causing data races may appear to vanish due to changes in an application's optimization level, thread...
Paul Sack, Brian E. Bliss, Zhiqiang Ma, Paul Peter...
IPPS
1998
IEEE
13 years 12 months ago
Optimizing Data Scheduling on Processor-in-Memory Arrays
In the study of PetaFlop project, Processor-In-Memory array was proposed to be a target architecture in achieving 1015 floating point operations per second computing performance. ...
Yi Tian, Edwin Hsing-Mean Sha, Chantana Chantrapor...