Running jobs on the IBM SP2, as in most distributed memory parallel system in the market today, is done by giving each job a subset of the available processors for its exclusive use. Scheduling jobs in FCFS order suuers from severe fragmentation that leads to utilization loss. This led Argonne National Lab, where the rst large SP1 was installed, to develop the EASY scheduler, which has since th...

LOCAL-SPIN ALGORITHMS FOR VARIANTS OF MUTUAL EXCLUSION USING READ AND WRITE OPERATIONS Robert Danek Doctor of Philosophy Graduate Department of Computer Science University of Toronto 2011 Mutual exclusion (ME) is used to coordinate access to shared resources by concurrent processes. We investigate several new N -process shared-memory algorithms for variants of ME, each of which uses only reads ...

Tujuan penelitian ini adalah menghasilkan aplikasi pelayanan antrian pasien dengan menggunakan metode First-Come-First-Served bahasa pemrograman PHP dan database MySQL. Puskesmas Pasar Ikan merupakan salah satu puskesmas milik Pemerintah Kota Bengkulu. Dalam melaksanakan terhadap yang akan berobat, belum memanfaatkan teknologi komputerisasi dalam memberikan antrian. Sementara saat pelayana baik...

Closed product-form queueing networks are considered. Mean value analysis is further developed to become "moment analysis", a recursive evaluation schema for moments of the queue lengths and customers' sojourn times at FCFS centers. As with mean value analysis, in general no state probabilities are needed. Moment analysis can be approximately done by an extended Linearizer algorithm.

In a project with repetitive activities, traditional scheduling methods like barchart are considered less effective to be used. So it would better if using special method . The commonly used is line of balance and flowline. its application, the two have several obstacles, both from technical visual perspective. Technically, will arrange workers shifted time that not effective. Visually, flowlin...

We consider polling models consisting of a single server that visits the queues in a cyclic order. In the vast majority of papers that have appeared on polling models, it is assumed that at each of the individual queues, the customers are served on a first-come-first-served (FCFS) basis. In this paper, we study polling models where the local scheduling policy is not FCFS but instead is varied a...

Most of the existing packet scheduling mechanisms of the wireless sensor network use First Come First Served (FCFS) non pre emptive priority and pre emptive priority scheduling algorithms. The above algorithms have high processing overhead and also long end-to-end data transmission delay. In FCFS concept the data packet which is entering the node first will go out first from the node, and the p...

Running jobs on the IBM SP2, as in most distributed memory parallel system in the market today, is done by giving each job a subset of the available processors for its exclusive use. Scheduling jobs in FCFS order suffers from severe fragmentation that leads to utilization loss. This led Argonne National Lab, where the first large SP1 was installed, to develop the EASY scheduler, which has since...

This paper is motivated by the response-time analysis of distributed information systems, where transactions are handled by a sequence of front-end server and back-end server actions. We study sojourn times in an open queueing network with a single Processor Sharing (PS) node and an arbitrary number of M multi-server First-Come-First-Served (FCFS) nodes. Customers arrive at the PS according to ...

In this paper we describe how the joint large deviation properties of traac streams are altered when the traac passes through a shared buuer according to a FCFS service policy with stochastic service capacity. We also consider the stationary case, proving large deviation principles for the state of the system in equilibrium and for departures from an equilibrium system.