Shortest path computation is required by a large number of applications such as VLSI, transportation and communication networks. These applications, which are often very complex and have sparse networks, generally use parallel labeling shortest path algorithms. Such algorithms, when implemented on a distributed memory machine, require termination detection methods; these methods consist of some...

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...

In shop scheduling, several applications exist where it is required that some components perform consecutively. We refer to no-idle schedules if machines are required to operate with no inserted idle time and no-wait schedules if tasks cannot wait between the end of an operation and the start of the following one. We consider here no-idle/no-wait shop scheduling problems with makespan as perfor...

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...