Many scheduling problems reside in uncertain and dynamic environments – tasks have a nonzero probability of failure and may need to be rescheduled. In these cases, an optimized ...
Andrew M. Sutton, Adele E. Howe, L. Darrell Whitle...
We consider the problem of scheduling dynamically arriving jobs in a non-clairvoyant setting, that is, when the size of a job in remains unknown until the job finishes execution. ...
: The accelerated development in Peer-to-Peer (P2P) and Grid computing has positioned them as promising next generation computing platforms. They enable the creation of Virtual Ent...
Rajkumar Buyya, David Abramson, Jonathan Giddy, He...
A real-time object is one whose state may become invalid with the passage of time. A temporal validity interval is associated with the object state, and the real-time object is te...
Optimized opportunistic multicast scheduling (OMS) is studied for cellular networks, where the problem of efficiently transmitting a common set of fountain-encoded data from a sin...
Tze-Ping Low, Man-On Pun, Yao-Win Peter Hong, C.-C...