Consistent Checkpoints of PVM Applications

Consistent Checkpoints of PVM Applications (1994)

by Georg Stellner

Venue:	In First European PVM User Group Meeting
Citations:	24 - 2 self

User correction supplied by SystemCorrections

Datum	Value	Source
TITLE	Consistent Checkpoints of PVM Applications	INFERENCE
AUTHOR NAME	Georg Stellner	SVM HeaderParse 0.1
AUTHOR AFFIL	Institut fur Informatik der Technischen Universitat Munchen; Lehrstuhl fur Rechnertechnik und Rechnerorganisation	SVM HeaderParse 0.2
AUTHOR ADDR	D-80290 Munchen; Tel.: ++49-89-21052689, Fax:++49-89-21058232	SVM HeaderParse 0.1
ABSTRACT	Introduction Currently PVM is the standard for developing parallel applications in workstation environments. One of its goals is to use the computational power of idling workstations. In practice many users refrain from opening their machine to other users' PVM processes. This is due to their experience that such a process, which usually requires a lot of resources (CPU and memory), increases the response time for short interactive commands, i.e. reduces his own productivity. In the following, we describe an approach which enhances existing queuing systems with a support for parallel PVM applications and allows the migration of PVM processes to other machines. Hence, users who start to work interactively on their machine are no longer bothered by resource consuming PVM processes. 2 Load Leveling with Queuing Systems The interaction of the user with the queuing system is based on the notion of jobs. Formally, a job is the obligation of the queuing	user correction - Legacy Corrections
YEAR	1994	INFERENCE
VENUE	In First European PVM User Group Meeting	INFERENCE
VENUE TYPE	CONFERENCE	INFERENCE
CITATIONS	6 found	ParsCit 1.0