As the cost-driven public cloud services emerge, budget constraint is one of the primary design issues in large-scale scientific applications executed on heterogeneous cloud computing systems. Minimizing the schedule length while satisfying the budget constraint of an application is one of the most important quality of service requirements for cloud providers. A directed acyclic graph (DAG) can...

A One-Dimensional Binary Integer Programming Problem (1DB-IPP) is concerned with selecting a subset from a set of k items in budget constraint to optimize an objective function. In this problem a dominant solution is defined as a feasible selection to which no further item could be added in budget constraint. This paper presents a simple algorithm for Enumeration of Dominant Solutions (EDS) and...

WDI. We express our gratitude to the editor, John McMillan and two anonymous referees for valuable comments and suggestions. ABSTRACT. We propose a clarification of the notion of a soft budget constraint, a concept widely used in the analysis of socialist, transitional, and market economies. Our interpretation is broad enough to embrace most existing approaches to soft budget constraint phenome...