Sciweavers

1292 search results - page 178 / 259
» Revisiting the optimal scheduling problem
Sort
View
ICPP
1999
IEEE
15 years 10 months ago
SLC: Symbolic Scheduling for Executing Parameterized Task Graphs on Multiprocessors
Task graph scheduling has been found effective in performance prediction and optimization of parallel applications. A number of static scheduling algorithms have been proposed for...
Michel Cosnard, Emmanuel Jeannot, Tao Yang
ISCAPDCS
2007
15 years 7 months ago
A rapid heuristic for scheduling non-preemptive dependent periodic tasks onto multiprocessor
We address distributed real-time applications represented by systems of non-preemptive dependent periodic tasks. This system is described by an acyclic directed graph. Because the...
Omar Kermia, Yves Sorel
SIAMDM
2002
124views more  SIAMDM 2002»
15 years 5 months ago
Scheduling Unrelated Machines by Randomized Rounding
We present a new class of randomized approximation algorithms for unrelated parallel machine scheduling problems with the average weighted completion time objective. The key idea i...
Andreas S. Schulz, Martin Skutella
GLOBECOM
2008
IEEE
16 years 14 days ago
QoS Routing in Wireless Mesh Networks with Cognitive Radios
— In this paper, we study QoS routing in wireless mesh networks with cognitive radios, which involves route selection, channel allocation and scheduling. It turns out to be a har...
Roberto Hincapie, Jian Tang, Guoliang Xue, Roberto...
ESA
2009
Springer
142views Algorithms» more  ESA 2009»
16 years 17 days ago
An Average-Case Analysis for Rate-Monotonic Multiprocessor Real-Time Scheduling
We introduce the First Fit Matching Periods algorithm for rate-monotonic multiprocessor scheduling of periodic tasks with implicit deadlines and show that it yields asymptotically...
Andreas Karrenbauer, Thomas Rothvoß