The purpose of this research in the queueing theory is the theorem about the law of the iterated logarithm in multiphase queueing systems and its application to the mathematical model of the message switching system. First the law of the iterated logarithm is proved for the cumulative idle time of a customer. Finally we present an application of the proved theorem for the model of the message s...

We develop a set of laws for reasoning about real-time programs using assertions (preconditions and postconditions) in the style of Hoare. In the real-time context assertions may refer to the current time and to the value of external inputs, which are not under the direct control of the program and hence not guaranteed to be stable with respect to the passage of time (even if the program does n...

In this paper the real time operation of an automatic teller machine (ATM) is analyzed using aTimed Petri Net (TPN) model. In the modeling, the probability of arrivals, the speed andattentiveness of customers (clients) are taken to account. Different parameters are based onthe statistical data. The model is simulated for 24 hours. The diagrams of number ofsucceeded customers, failed references ...

We consider a queueing loss system with heterogeneous skill based servers with arbitrary distributions. We assume Poisson arrivals, with each arrival having a vector indicating which of the servers are eligible to serve it. Arrivals can only be assigned to a server that is both idle and eligible. We assume arrivals are assigned to the idle eligible server that has been idle the longest and deri...

The Share algorithm for predicting disk idle time described by Helmbold, et al was implemented and run on the cello1 dataset. As in the original paper, the share algorithm performed slightly better than the 2-Competitive algorithm and a lot better than the 30-second Fixed Time-Out algorithm. As expected, the Share algorithm performed worse than the Optimal algorithm. It was determined that vary...

Sarkar and Zangwill (1991) showed by numerical examples that reduction in setup times can, surprisingly, actually increase work in process in some cyclic production systems (that is, reduction in switchover times can increase waiting times in some polling models). We present, for polling models with exhaustive and gated service disciplines, some explicit formulas that provide additional insight...

In the framework of perfect loop nests with uniform dependencies, tiling has been studied extensively as a source-to-source program transformation. We build upon recent results by HH ogsted, Carter, and Ferrante 10], who aim at determining the cumulated idle time spent by all processors while executing the partitioned (tiled) computation domain. We propose new, much shorter proofs of all their ...

We study options on short-term leases for capital-intensive equipment performing specific functions and services, such as leases for semi-submersible drilling rigs, marine seismic services, corporate real estate leasing, retail space leasing, and apartment leasing. We quantify the effect of an important factor in pricing options on these services: idle time between consecutive lease contracts. ...

We consider a variant of no-wait flowshop scheduling that is motivated by continuous casting in the multistage production process in steel manufacturing. The task is to find a feasible schedule with a minimum number of interruptions, i.e., continuous idle time intervals on the last production stage. Based on an interpretation as Eulerian Extension Problems, we fully settle the complexity status...