Parallel execution of independent simulation programs is one method of speeding-up discrete-event simulation modeling in the development process for complex systems. Existing cluster-based computing systems largely use First Come, First Served (FCFS) distribution of programs. Remote Execution with Load Observation And Distribution (RELOAD) is a new method of distributing independent programs to...

The performance of contiguous allocation strategies can be significantly affected by the distribution of job execution times. In this paper, the performance of the existing contiguous allocation strategies for 3D mesh multicomputers is re-visited in the context of heavy-tailed distributions (e.g., a Bounded Pareto distribution). The strategies are evaluated and compared using simulation experim...

Abstract Consider a stable M/G/1 system in which, at time $$t=0$$ t = 0 , there are exactly n customers with residual service times equal to $$v_1,v_2,\ldots ,v_n$$ v 1 , ...

We study a parallel service queueing system with servers of types s1, . . . , sJ , customers of types c1, . . . , cI , bipartite compatibility graph G, where arc (ci, sj) indicates that server type sj can serve customer type ci, and service policy of first come first served FCFS, assign longest idle server ALIS. For a general renewal stream of arriving customers and general service time distrib...

In a machine that follows the dynamically trace scheduled VLIW (DTSVLIW) architecture, VLIW instructions are built dynamically through an algorithm that can be implemented in hardware. These VLIW instructions are cached so that the machine can spend most of its time executing VLIW instructions without sacrificing any binary compatibility. This paper evaluates the effectiveness of the DTSVLIW in...

We consider the FCFS GI/GI/n queue in the Halfin-Whitt heavy traffic regime, and prove bounds for the steady-state probability of delay (s.s.p.d.) for generally distributed processing times. We prove that there exists ε > 0, depending on the inter-arrival and processing time distributions, such that the s.s.p.d. is bounded from above by exp ( − εB ) as the associated excess parameter B →∞; and ...

This paper analyzes a class of common-component allocation rules, termed no-holdback (NHB) rules, in continuous-review assemble-to-order (ATO) systems with positive lead times. The inventory of each component is replenished following an independent base-stock policy. In contrast to the usually assumed first-come-first-served (FCFS) component allocation rule in the literature, an NHB rule alloca...

We study various models for the one-dimensional multi-stage facility location problems with transient agents, where a agent arrives in some stage and stays number of consecutive stages. In problems, we need to serve each one their stages by determining at stage. first model, assume there is no cost moving across focus on optimal algorithms minimize both social objective, defined as total distan...