319 search results - page 22 / 64 » Worst-Case Analysis of Scheduling Heuristics of Parallel Sys... |
RTCSA
2007
IEEE
14 years 1 months ago
2007
IEEE
This paper presents a real-time scheduling algorithm with high schedulability and few preemptions for multiprocessor systems. The algorithm is based on an unorthodox method called...
CLUSTER
2000
IEEE
13 years 7 months ago
2000
IEEE
Clusters of workstations and networked parallel computing systems are emerging as promising computational platforms for HPC applications. The processors in such systems are typica...
IOR
2002
13 years 7 months ago
2002
We describe a simple on-line heuristic for scheduling job-shops. We assume there is a fixed set of routes for the jobs, and many jobs, say N, on each route. The heuristic uses saf...
DSN
2003
IEEE
14 years 27 days ago
2003
IEEE
Our goal is to automatically obtain a distributed and fault-tolerant embedded system: distributed because the system must run on a distributed architecture; fault-tolerant because...
ICFP
2008
ACM
14 years 7 months ago
2008
ACM
The trend in microprocessor design toward multicore and manycore processors means that future performance gains in software will largely come from harnessing parallelism. To reali...