Sciweavers

3934 search results - page 51 / 787
» Approximate Schedulability Analysis
Sort
View
149
Voted
TASE
2008
IEEE
15 years 4 months ago
Steady-State Throughput and Scheduling Analysis of Multicluster Tools: A Decomposition Approach
Abstract--Cluster tools are widely used as semiconductor manufacturing equipment. While throughput analysis and scheduling of single-cluster tools have been well-studied, research ...
Jingang Yi, Shengwei Ding, Dezhen Song, Mike Tao Z...
GLOBECOM
2007
IEEE
15 years 11 months ago
Graph Theoretical Analysis of Opportunistic Scheduling Policy for Wireless Ad Hoc Networks
— 1 Taking advantage of the independent fading channel conditions among multiple wireless users, opportunistic transmissions schedule the user with the instantaneously best condi...
Qing Chen, Fei Ye, Zhisheng Niu
SIGMETRICS
2004
ACM
127views Hardware» more  SIGMETRICS 2004»
15 years 10 months ago
Performance analysis of LAS-based scheduling disciplines in a packet switched network
The Least Attained Service (LAS) scheduling policy, when used for scheduling packets over the bottleneck link of an Internet path, can greatly reduce the average flow time for sh...
Idris A. Rai, Guillaume Urvoy-Keller, Mary K. Vern...
149
Voted
HPDC
2010
IEEE
15 years 6 months ago
Performance analysis of dynamic workflow scheduling in multicluster grids
Scientists increasingly rely on the execution of workflows in grids to obtain results from complex mixtures of applications. However, the inherently dynamic nature of grid workflo...
Omer Ozan Sonmez, Nezih Yigitbasi, Saeid Abrishami...
STOC
1996
ACM
132views Algorithms» more  STOC 1996»
15 years 9 months ago
Approximability and Nonapproximability Results for Minimizing Total Flow Time on a Single Machine
We consider the problem of scheduling n jobs that are released over time on a single machine in order to minimize the total ow time. This problem is well-known to be NPcomplete, a...
Hans Kellerer, Thomas Tautenhahn, Gerhard J. Woegi...