Sciweavers

517 search results - page 28 / 104
» Approximation Algorithms for Scheduling with Reservations
Sort
View
ASPLOS
2006
ACM
15 years 3 months ago
A spatial path scheduling algorithm for EDGE architectures
Growing on-chip wire delays are motivating architectural features that expose on-chip communication to the compiler. EDGE architectures are one example of communication-exposed mi...
Katherine E. Coons, Xia Chen, Doug Burger, Kathryn...
ICALP
2009
Springer
15 years 10 months ago
Improved Algorithms for Latency Minimization in Wireless Networks
In the interference scheduling problem, one is given a set of n communication requests described by sourcedestination pairs of nodes from a metric space. The nodes correspond to d...
Alexander Fanghänel, Berthold Vöcking, T...
ECRTS
1999
IEEE
15 years 2 months ago
Handling sporadic tasks in off-line scheduled distributed real-time systems
Many industrial applications mandate the use of a timetriggered paradigm and consequently the use of off-line scheduling for reasons such as predictability, certification, cost, o...
Damir Isovic, Gerhard Fohler
DEXAW
1999
IEEE
91views Database» more  DEXAW 1999»
15 years 2 months ago
Hierarchical Scheduling Algorithms for Near-Line Tape Libraries
Robotic tape libraries (RTLs) currently enjoy a prominent place in the storage market, with a reported average annual growth rate approaching 34%, primarily due to their low cost ...
Peter Triantafillou, Ioannis Georgiadis
FOCS
2008
IEEE
15 years 4 months ago
Submodular Approximation: Sampling-based Algorithms and Lower Bounds
We introduce several generalizations of classical computer science problems obtained by replacing simpler objective functions with general submodular functions. The new problems i...
Zoya Svitkina, Lisa Fleischer