Abstract—Among the numerous DAG scheduling heuristics suitable for heterogeneous systems, the Heterogeneous Earliest Finish Time (HEFT) heuristic is known to give good results in...
Luiz F. Bittencourt, Rizos Sakellariou, Edmundo R....
In this paper we present an algorithm for scheduling parallel applications that consist of a divisible workload. Our algorithm uses multiple rounds to overlap communication and co...
—Switch-trees are peer-to-peer algorithms for building and improving end-host multicast trees. Nodes switch parents to reduce tree cost or lower source-member latency. A node swi...
An accurate, tractable, analytic cache model for time-shared systems is presented, which estimates the overall cache missrate of a multiprocessing system with any cache size and t...
In this paper we present a technique for reducing response delay for web systems, which is based on a proactive cache scheme. It combines predictive pre-fetching and streaming to ...