Sciweavers

1095 search results - page 14 / 219
» Efficient Algorithms for Average Completion Time Scheduling
Sort
View
ICC
2007
IEEE
132views Communications» more  ICC 2007»
15 years 1 months ago
Supporting Bulk Data Transfers of High-End Applications with Guaranteed Completion Time
In high-end grid networks, distributed resources (scientific instruments, CPUs, storages, etc.) are interconnected to support computing-intensive and data-intensive applications, w...
Bin Bin Chen, Pascale Vicat-Blanc Primet
RTAS
2010
IEEE
14 years 7 months ago
An Efficient Algorithm for Real-Time Divisible Load Scheduling
Providing QoS and performance guarantees to arbitrarily divisible loads has become a significant problem for many cluster-based research computing facilities. While progress is be...
Anwar Mamat, Ying Lu, Jitender S. Deogun, Steve Go...
APPROX
2009
Springer
153views Algorithms» more  APPROX 2009»
15 years 4 months ago
Average-Case Analyses of Vickrey Costs
We explore the average-case “Vickrey” cost of structures in a random setting: the Vickrey cost of a shortest path in a complete graph or digraph with random edge weights; the V...
Prasad Chebolu, Alan M. Frieze, Páll Melste...
WCE
2007
14 years 11 months ago
Dynamic Scheduling Algorithm for input-queued crossbar switches
— Crossbars are main components of communication switches used to construct interconnection networks. Scheduling algorithm controls contention in switch architecture. Several sch...
Mihir V. Shah, Mehul C. Patel, Dinesh J. Sharma, A...
SPAA
2010
ACM
14 years 10 months ago
Buffer-space efficient and deadlock-free scheduling of stream applications on multi-core architectures
We present a scheduling algorithm of stream programs for multi-core architectures called team scheduling. Compared to previous multi-core stream scheduling algorithms, team schedu...
JongSoo Park, William J. Dally