The parallel machine scheduling problem has been a popular topic for many years due to its theoretical and practical importance. This paper addresses the robust makespan optimization on unrelated with sequence-dependent setup times, where processing times are uncertain, only knowledge is time intervals they take values from. We propose model min-max regret criterion formulate this problem. To s...

In this research work, a fault tolerant extension of the de facto message passing system parallel virtual machine, TSparallel virtual machine, is introduced. This extension enables real time applications over parallel virtual machine. In PVM and similar message passing systems, if the message receiver is not available, due to network failure or machine crash, a failure is reported and data must...

This paper deals with the problem of the parallel composition construction for two Timed Finite State Machines (TFSMs). As a key to the solution of this problem we use parallel composition of common Finite State Machines (FSMs). We transform given TFSMs to FSMs and prove theorem, that obtained FSMs correctly describe behaviour of the given TFSMs. Then we build parallel composition of these FSMs...

We have implemented a parallel graph reducer on a commercially available shared memory multiprocessor (a Sequent Symmetry TM ), that achieves real speedup compared to a a fast compiled implementation of the conventional Gmachine. Using 15 processors, this speedup ranges between 5 and 11, depending on the program. Underlying the implementation is an abstract machine called the h ; Gi-machine. We...

We have implemented a parallel graph reducer on a commercially available shared memory multiprocessor (a Sequent Symmetry TM ), that achieves real speedup compared to a a fast compiled implementation of the conventional Gmachine. Using 15 processors, this speedup ranges between 5 and 11, depending on the program. Underlying the implementation is an abstract machine called the h ; Gi-machine. We...