Multiprocessor task scheduling is an important and computationally difficult problem. This paper proposes a comparison study of genetic algorithm and list scheduling algorithm. Bo...
Hierarchical scheduling has been proposed as a scheduling technique to achieve aggregate resource partitioning among related groups of threads and applications in uniprocessor and...
Quality of service (QoS) mechanisms allowing users to request for turn-around time guarantees for their jobs have recently generated much interest. In our previous work we had des...
Mohammad Islam, Pavan Balaji, Gerald Sabin, P. Sad...
Distributed parallel applications often run for hours or even days before arriving to a result. In the case of such long-running programs, the initial requirements could change aft...
Dong Kwan Kim, Myoungkyu Song, Eli Tilevich, Calvi...
Streaming data models have been shown to be useful in many applications requiring high-performance data exchange. Application-level overlay networks are a natural way to realize t...
Greg Eisenhauer, Matthew Wolf, Hasan Abbasi, Karst...