Heterogeneous servers, in manufacturing and service systems, may have different speeds and different quality levels for the provided service or good. For a two-server queueing model, we formulate the routing problem of minimizing a weighted sum of the expected time in the system and the throughput of unsatisfied customers. Using a Markov decision process approach, we prove that the optimal rout...

Real-time media servers are becoming increasingly important due to the rapid transition of the Internet from text and graphics based applications to multimedia-driven environments. In order to meet these ever increasing demands, real-time media servers are responsible for supporting a large number of clients with a heterogeneous mix of Quality of Service (QoS) requirements. In this paper, we pr...

In this paper, the major goal is to achieve searching in distributed network with proper ranking. Heterogeneous framework is going to be utilized using existing machines and high-end workstations. Data redundancy is responsible for enhancing dynamic scheduling in run-time. Dynamic scheduling is going to be exploited determining possible sub-network and related servers for specific user targeted...

In many-server systems with heterogeneous servers, the Fastest-Server-First (FSF) policy is known for its excellent performance. However, when service rates are unknown and/or time-varying, implementing the FSF policy is not straightforward. We thus propose a routing algorithm, Performance-Based Routing, that approximates the FSF policy: servers are ranked in a dynamic list, where the shorter t...

To aid in building high-performance computational environments, INTERLACE offers a framework for linking reusable computational engines in a heterogeneous distributed system. The INTERLACE model provides clients with access to computational servers which interface with “wrapped” computational engines. An API is defined for establishing the server interconnection requirements including data orga...

Contemporary megawatt-scale data centers have emerged to meet the increasing demand for online cloud services and big analytics. However, in such large-scale centers, servers of different generations are installed gradually year by year, making center heterogeneous computing capability energy efficiency. Furthermore, due processor architectures, complex diverse load dynamic changing, business c...

Consider a Markovian system of two stations in tandem with finite intermediate buffer and two servers. The servers are heterogeneous, flexible, and more efficient when they work on their own than when they collaborate. We determine how the servers should be assigned dynamically to the stations with the goal of maximizing the system throughput. We show that the optimal policy depends on whether ...

The proposed spam filtering architecture for MTA servers is a component based architecture that allows distributed processing and centralized knowledge. This architecture allows heterogeneous systems to coexist and benefit from a centralized knowledge source and filtering rules. MTA servers in the infrastructure contribute to a common knowledge, allowing for a more rational resource usage. The ...

On continuous media(CM) servers, data are handled periodically. The length of the period or round length has a strong innuence on the performance of CM servers, and the optimal round length for a server is determined mainly by the bit rate of the media object. As far as we know, all existing disk scheduling schemes are of single round length, in which all objects are serviced using a same round...