In many distributed computing environments, collections of applications need to be
processed using a set of heterogeneous computing (HC) resources to maximize some …

We present several protocols to achieve mutual communication anonymity between an
information requester and a provider in a P2P information-sharing environment, such that …

In software service provision, the overall performance of a composite service is often the
ultimate focus of concern rather than those of its individual components. This opens new …

Large scientific parallel applications demand large amounts of memory space. Current
parallel computing platforms schedule jobs without fully knowing their memory …

In this paper, a new I/O-aware load-balancing scheme is presented to improve overall
performance of a distributed system with a general and practical workload including I/O …

The paper presents a performance model that can be used to optimally distribute
computations over heterogeneous computers. This model is application‐centric …

In this paper we investigate the issue of resource matching between jobs and machines in
Intel's compute farm. We show that common heuristics such as Best-Fit and Worse-Fit may …

This paper presents a general model to define, measure and predict the efficiency of
applications running on heterogeneous parallel computer systems. Using this framework, it …

In a cluster system with dynamic load sharing support, a job submission or migration to a
workstation is determined by the availability of CPU and memory resources of the …

While resource management and task scheduling are identified challenges of grid
computing, current grid scheduling systems mainly focus on CPU and network availability …