Sciweavers

1609 search results - page 112 / 322
» A Microeconomic Scheduler for Parallel Computers
Sort
View
IPPS
1999
IEEE
15 years 10 months ago
The MuSE System: A Flexible Combination of On-Stack Execution and Work-Stealing
Executing subordinate activities by pushing return addresses on the stack is the most e cient working mode for sequential programs. It is supported by all current processors, yet i...
Markus Leberecht
JSSPP
2004
Springer
15 years 11 months ago
Reconfigurable Gang Scheduling Algorithm
 Using a single traditional gang scheduling algorithm cannot provide the best performance for all workloads and parallel architectures. A solution for this problem is the use of...
Luís Fabrício Wanderley Góes,...
IPPS
2007
IEEE
16 years 22 days ago
Bi-criteria Scheduling Algorithm with Deployment in Cluster
Computational grids clusters, provide powerful computing resources for executing applications of large scale. In Grid (clusters) usually several applications run simultaneously.Th...
Feryal-Kamila Moulaï, Gregory Mounie
FGCS
1992
103views more  FGCS 1992»
15 years 7 months ago
Parallel Inference Machine PIM
: There have been no major control problems during the first three years of the new Tokaido-Sanyo Shinkansen (bullet train) Programmed Route Control (PRC) computer system. Prior to...
Kazuo Taki
ICCAD
2009
IEEE
179views Hardware» more  ICCAD 2009»
15 years 4 months ago
Automatic memory partitioning and scheduling for throughput and power optimization
Hardware acceleration is crucial in modern embedded system design to meet the explosive demands on performance and cost. Selected computation kernels for acceleration are usually ...
Jason Cong, Wei Jiang, Bin Liu, Yi Zou