Transparent process migration: design alternatives and the sprite implementation
Software—Practice & Experience
The available capacity of a privately owned workstation environment
Performance Evaluation
Semi-Distributed Load Balancing for Massively Parallel Multicomputer Systems
IEEE Transactions on Software Engineering
The interaction of parallel and sequential workloads on a network of workstations
Proceedings of the 1995 ACM SIGMETRICS joint international conference on Measurement and modeling of computer systems
The utility of exploiting idle workstations for parallel computation
SIGMETRICS '97 Proceedings of the 1997 ACM SIGMETRICS international conference on Measurement and modeling of computer systems
Limitations of cycle stealing for parallel processing on a network of homogeneous workstations
Journal of Parallel and Distributed Computing
Coordinating parallel processes on networks of workstations
Journal of Parallel and Distributed Computing
IEEE Transactions on Parallel and Distributed Systems
Modern Operating Systems
Collecting Unused Processing Capacity: An Analysis of Transient Distributed Systems
IEEE Transactions on Parallel and Distributed Systems
Application of Petri Nets to Communication Networks, Advances in Petri Nets
Computing Twin Primes and Brun's Constant: A Distributed Approach
HPDC '98 Proceedings of the 7th IEEE International Symposium on High Performance Distributed Computing
Future Generation Computer Systems
Scheduling the interactions of multiple parallel jobs and sequential jobs on a non-dedicated cluster
ICCSA'05 Proceedings of the 2005 international conference on Computational Science and Its Applications - Volume Part IV
Hi-index | 0.00 |
This paper presents a performance evaluation of the interactions between local sequential processes running on behalf of interactive applications and parallel processes running as part of an overall parallel application on a non-dedicated cluster environment. To control the interactions between the two types of processes we propose to constrain the scheduling of local interactive processes (IPs) by a measure of the maximum response time (MRT) expected by the workstation (WS) user. The measure is assumed obtained through empirical studies. We propose a mathematical model of the scheduling problem based on the usage of the MRT measure. In addition, we propose a scheduling scheme that within the MRT cycle computes the time quanta needed to satisfy the requirements of both local IPs and the parallel task process present in the system. A colored Petri net (CPN) is used to model the scheduling scheme. Simulations of the CPN model and numerical results have shown the effectiveness of the proposed scheduling scheme in allowing the parallel task to ensure a minimum speedup even in heavy-loaded situations and to maximize the speedup adaptively depending on load conditions. In addition the simulation results revealed the sensitivity of the interactions to factors such as interactive job demand, parallel job demand, and arrival rate of interactive jobs among other. Finally, simulation and analytical results have been found to agree nicely thus confirming the correctness of the proposed analytical model.