178 search results - page 9 / 36 » Bounds, Heuristics, and Approximations for Distribution Syst... |
IPPS
2009
IEEE
14 years 2 months ago
2009
IEEE
In this paper, we deal with the large-scale divisible load problem studied in [12]. We show how to reduce this problem to a classical preemptive scheduling problem on a single mac...
LCTRTS
2001
Springer
14 years 1 days ago
2001
Springer
This paper presents an end-to-end synthesis technique for lowpower distributed real-time system design. This technique synthesizes supply voltages of resources to optimize system-...
FORMATS
2007
Springer
14 years 1 months ago
2007
Springer
Abstract. Quantitative model checking computes the probability values of a given property quantifying over all possible schedulers. It turns out that maximum and minimum probabilit...
OPODIS
2010
13 years 5 months ago
2010
The Earliest Deadline First (EDF) scheduling algorithm is known to be suboptimal for meeting all deadlines under global scheduling on multiprocessor platforms. However, EDF is an a...
QUESTA
2010
13 years 6 months ago
2010
The M/G/K queueing system is one of the oldest model for multi-server systems, and has been the topic of performance papers for almost half a century. However, even now, only coar...