In this paper we investigate protocols for scheduling applications that consist of large numbers of identical, independent tasks on large-scale computing platforms. By imposing a ...
Barbara Kreaseck, Larry Carter, Henri Casanova, Je...
— We consider a multiuser network that is shared by noncooperative users. Each user sets up virtual paths that optimize its own selfish performance measure. This measure account...
Aurel A. Lazar, Ariel Orda, Dimitrios E. Pendaraki...
— With the advent of MPLS, the restoration times of communications is decreased down to 50 ms by the use of preconfigured backup LSPs. To ensure there are enough resources after ...
Mohand Yazid Saidi, Bernard Cousin, Jean-Louis Le ...
It is well-known that opportunistic transmission schemes are sumcapacity optimal, in the Shannon sense, for symmetric cellular networks with single-antenna transceivers. However, ...
Pengcheng Zhan, Ramesh Annavajjala, A. Lee Swindle...
We study three scheduling problems (file redistribution, independent tasks scheduling and broadcasting) on large scale heterogeneous platforms under the Bounded Multi-port Model. I...