Sciweavers

1156 search results - page 67 / 232
» Optimal scheduling of task graphs on parallel systems
Sort
View
CCGRID
2009
IEEE
15 years 6 months ago
Efficient Grid Task-Bundle Allocation Using Bargaining Based Self-Adaptive Auction
To address coordination and complexity issues, we formulate a grid task allocation problem as a bargaining based self-adaptive auction and propose the BarSAA grid task-bundle alloc...
Han Zhao, Xiaolin Li
DAC
2009
ACM
15 years 9 months ago
GPU-based parallelization for fast circuit optimization
The progress of GPU (Graphics Processing Unit) technology opens a new avenue for boosting computing power. This work is an attempt to exploit GPU for accelerating VLSI circuit opt...
Yifang Liu, Jiang Hu
IPPS
2000
IEEE
15 years 9 months ago
Buffered Coscheduling: A New Methodology for Multitasking Parallel Jobs on Distributed Systems
Buffered coscheduling is a scheduling methodology for time-sharing communicating processes in parallel and distributed systems. The methodology has two primary features: communica...
Fabrizio Petrini, Wu-chun Feng
ISCA
2008
IEEE
112views Hardware» more  ISCA 2008»
15 years 11 months ago
Parallelism-Aware Batch Scheduling: Enhancing both Performance and Fairness of Shared DRAM Systems
In a chip-multiprocessor (CMP) system, the DRAM system is shared among cores. In a shared DRAM system, requests from a thread can not only delay requests from other threads by cau...
Onur Mutlu, Thomas Moscibroda
152
Voted
IPPS
2006
IEEE
15 years 11 months ago
Flexible tardiness bounds for sporadic real-time task systems on multiprocessors
The earliest-deadline-first (EDF) scheduling of a sporadic real-time task system on a multiprocessor may require that the total utilization of the task system, Usum, not exceed (...
UmaMaheswari C. Devi, James H. Anderson