In this chapter we present recent contributions in the field of sequential job scheduling on network machines which work in parallel; these are subject to temporary unavailability...
Florian Diedrich, Klaus Jansen, Ulrich M. Schwarz,...
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 design an iterative rounding approach for the classic prize-collecting Steiner forest problem and more generally the prize-collecting survivable Steiner network de...
The capacity scaling property specifies the changes in network throughput when network size increases and serves as an essential performance evaluation metric for large-scale wir...
Abstract-- This paper proposes a state reduction algorithm for incompletely specified FSMs. The algorithm is based on iterative improvements. When the number of compatibles is like...