Abstract. We present a parallel job scheduling approach for coarsegrain timesharing which preempts jobs to disk and avoids any additional memory pressure. The approach provides con...
Abstract— Network utility maximization (NUM) problems provide an important approach to conduct network resource management such as end-to-end rate allocation. In the existing lit...
Abstract. This paper introduces a problem called the temporal knapsack problem, presents several algorithms for solving it, and compares their performance. The temporal knapsack pr...
Mark Bartlett, Alan M. Frisch, Youssef Hamadi, Ian...
Abstract: Traffic engineering in P2P networks deals with organizing overlay networks. The challenge of unavailability has not been mastered yet. Considering the resource allocatio...
Abstract. So far only few performance studies on parallel object-relational database systems are available. In particular, the relative performance of relational vs. reference-base...