In hierarchical reliable multicast environment, makespan is the time that is required to fully and successfully transmit a packet from the sender to all receivers. Low makespan is vital for achieving high throughput with a TCP-like window based sending scheme. In hierarchical reliable multicast methods, the number of repair servers and their locations influence the makespan. In this paper we pr...

This paper proposes an open architecture for building a geographical information search engine over the Internet based on the Geographical Markup Language (GML). It recognizes the autonomous and heterogeneous nature of the current practice of the Internet by adding GML-enabled wrappers for distributed servers and a mediator tier. The paper then presents a prototype based on the proposed open ar...

Traditional servers account for more than 1.5% of the US electricity use though spend their lives largely underutilized or idle. Because a large portion of power in a data center is due directly or indirectly to servers, power savings in a data center environment can be achieved simply by using lower power hardware in place of these traditional servers. However, deciding which hardware to use i...

In this paper we study the problem of designing compact, adaptive strategies for the distribution of objects among a heterogeneous set of servers. Ideally, such a strategy should allow the computation of the position of an object with a low time and space complexity, and it should be able to adapt with a near-minimum amount of replacements of objects to changes in the capabilities of the server...

We consider the problem of scheduling a group of heterogeneous, distributed processes to a group of heterogeneous resource pools (physical servers, clusters of processors/cores) each with different types of resources. The processes specify their preference-constraints [20] and linearly elastic resource needs for heterogeneous resource pools. Our setting is a neutral, public cloud datacenter [6]...

This paper presents techniques for dynamic load balancing in heterogeneous computing environments. That is, the techniques are designed for sets of machines with varying processing capabilities and memory capacities. These methods can also be applied to homogenous systems in which the effective compute speed or memory availability is reduced by the presence of other programs running outside the...

Mobile objects are programs passed between distributed information servers for execution on remote sites within a limited environment. We describe the MHEG virtual machine speciication which supports mobile code in a heterogeneous environment. MHEG VM is suitable for integration in many diierent distributed information systems, including the WWW. We brieey describe the possible integration of t...

The conventional approach to distributed access-control (AC) tends to be servercentric. Under this approach, each server establishes its own policy regarding the use of its resources and services by its clients. The choice of this policy, and its implementation, are generally considered the prerogative of each individual server. This approach to access-control may be appropriate for many curren...

We consider multi-class multi-server queuing systems where a subset of servers, called a server pool, may collaborate in serving jobs of a given class. The pools of servers associated with different classes may overlap, so the sharing of server resources across classes is done via a dynamic allocation policy based on a fairness criterion. We consider an asymptotic regime where the total load in...

Open Mathematical Engine Interface (OMEI) aims to establish a uniform application programming interface specification (API) for heterogeneous mathematical computation systems. OMEI can play an essential role in making mathematical engines easily accessible by front-ends, tools, and servers. The interface enables the development of individual applications that can serve different engines. The mo...