A local graph partitioning algorithm finds a cut near a specified starting vertex, with a running
time that depends largely on the size of the small side of the cut, rather than the size of the …

We establish the following, quite unexpected, result: replication of data for the computational
private information retrieval problem is not necessary. More specifically, based on the …

In this paper, we assume an environment with multiple, heterogeneous resources, which
provide services of different capabilities and of a different cost. Users want to make use of …

Today's Massively Multiplayer Online Games (MMOGs) can include millions of concurrent
players spread across the world and interacting with each other within a single session …

The resource availability in Grids is generally unpredictable due to the autonomous and
shared nature of the Grid resources and stochastic nature of the workload resulting in a best …

The grid vision of a single computing utility has yet to materíalize: while many grids with
thousands of processors each exist, most work in isolation. An important obstacle for the …

We investigate interoperability aspects of scientific workflow systems and argue that the
workflow execution environment, the model of computation (MoC), and the workflow …

The problem of Grid‐middleware interoperability is addressed by the design and analysis of
a feature‐rich, standards‐based framework for all‐to‐all cross‐middleware job submission …

Massively Multiplayer Online Games (MMOGs) are a class of computationally intensive
client–server applications with severe real-time Quality of Service (QoS) requirements, such …

High energy consumption in data center has become a key problem, and the Carbon (CO _2
2) emissions from data center have serious impacts on environment. To improve traditional …