#### Filter Results:

#### Publication Year

1975

2015

#### Co-author

#### Key Phrase

#### Publication Venue

Learn More

A single-server processor-sharing system with M job classes is analyzed in the steady state. The scheduling strategy considered divides the total processor capacity in unequal fractions among the different job classes. More precisely, if there are N~jobs of classj in the system, j = 1, 2 ..... M, each class k job receives a fraction gh/(~M.~ giN~) of the… (More)

New methods are presented for parallel simulation of discrete event systems that, when applicable, can usefully employ a number of processors much larger than the number of objects in the system being simulated, Abandoning the distributed event list approach, the simulation problem is posed using recurrence relations. We bring three algorithmic ideas to… (More)

- Isi Mitrani
- 1998

Queuing networks are studied at selected points in the steady state, namely, at the moments when jobs of a given class arrive into a given node (either from the outside or from other nodes) and at the moments when jobs of a given class leave a given node (either for the outside or for other nodes). The processes defined by these points are known to be, in… (More)

We examine a system where the servers in a cluster may be switched dynamically and preemptively from one kind of work to another. The demand consists of M job types joining separate queues, with different arrival and service characteristics, and also different relative importance represented by appropriate holding costs. The switching of a server from queue… (More)

A family of message propagation protocols for highly mobile ad-hoc networks is defined, and is studied analytically and by simulation. The coverage of a message (the fraction of nodes that receive it), can be made arbitrarily close to 1, at a moderate cost of extra message traffic. Under certain simplifying assumptions, it is shown that a high coverage is… (More)

Chakka, R. and I. Mitrani, Heterogeneous multiprocessor systems with breakdowns: A model of a system with N parallel processors subject to occasional interruptions of service, and a common unbounded queue fed by a Poisson arrival stream, is analyzed in the steady state. The service, breakdown and repair characteristics may vary from processor to processor.… (More)