A scalable time-sharing scheduling for partitionable distributed memory parallel machines

	This Article
	PDF RSS feed
	Share
	Email this Article to a friend
	Bibliographic References
	ASCII Text BibTex RefWorks Procite/RefMan/Endnote
	Add to:
	Digg Furl Spurl Blink Simpy Google Del.icio.us Y!MyWeb
	Search
	Similar Articles Articles by A. Hori Articles by M. Maeda Articles by Y. Ishikawa Articles by T. Tomokiyo Articles by H. Konaka

28th Hawaii International Conference on System Sciences (HICSS'95)

A scalable time-sharing scheduling for partitionable distributed memory parallel machines (PDF)

Hawaii, USA

January 04-January 07

ISBN: 0-8186-6935-7

	ASCII Text	x
	A. Hori, M. Maeda, Y. Ishikawa, T. Tomokiyo, H. Konaka, "A scalable time-sharing scheduling for partitionable distributed memory parallel machines," Hawaii International Conference on System Sciences, pp. 173, 28th Hawaii International Conference on System Sciences (HICSS'95), 1995.

	BibTex	x
	@article{ 10.1109/HICSS.1995.375465, author = {A. Hori and M. Maeda and Y. Ishikawa and T. Tomokiyo and H. Konaka}, title = {A scalable time-sharing scheduling for partitionable distributed memory parallel machines}, journal ={Hawaii International Conference on System Sciences}, volume = {0}, year = {1995}, issn = {1060-3425}, pages = {173}, doi = {http://doi.ieeecomputersociety.org/10.1109/HICSS.1995.375465}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, }

	RefWorks Procite/RefMan/Endnote	x
	TY - CONF JO - Hawaii International Conference on System Sciences TI - A scalable time-sharing scheduling for partitionable distributed memory parallel machines SN - 1060-3425 SP EP A1 - A. Hori, A1 - M. Maeda, A1 - Y. Ishikawa, A1 - T. Tomokiyo, A1 - H. Konaka, PY - 1995 KW - processor scheduling; trees (mathematics); distributed memory systems; parallel machines; time-sharing systems; reconfigurable architectures; scalable time-sharing scheduling; partitionable distributed memory parallel machines; process scheduling queue system; distributed queue tree; dynamically partitionable parallel machines; nested; dynamically nested partitioning; time-sharing scheduling; interactive environment; processor utilization; process scheduling queues; round-robin scheduling algorithm; task allocation policies; simulation results; time-sharing; batch scheduling; high-load situations VL - 0 JA - Hawaii International Conference on System Sciences ER -

A. Hori, Real World Comput. Partnership, Tsukuba Res. Center, Ibaraki, Japan

M. Maeda, Real World Comput. Partnership, Tsukuba Res. Center, Ibaraki, Japan

Y. Ishikawa, Real World Comput. Partnership, Tsukuba Res. Center, Ibaraki, Japan

T. Tomokiyo, Real World Comput. Partnership, Tsukuba Res. Center, Ibaraki, Japan

H. Konaka, Real World Comput. Partnership, Tsukuba Res. Center, Ibaraki, Japan

DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/HICSS.1995.375465

We propose a new process scheduling queue system called the distributed queue tree (DQT) for a distributed memory, dynamically partitionable parallel machines. We assume that partitions can be nested dynamically and that a process in a partition can be preempted. The combination of dynamically nested partitioning and time-sharing scheduling may provide an interactive environment and higher processor utilization. The key idea of DQT is to distribute process scheduling queues to each partition. We propose a round-robin scheduling algorithm and several task allocation policies on DQT. The simulation results show that time-sharing with DQT results in better processor utilization than that available from batch scheduling in high-load situations.

Index Terms:

processor scheduling; trees (mathematics); distributed memory systems; parallel machines; time-sharing systems; reconfigurable architectures; scalable time-sharing scheduling; partitionable distributed memory parallel machines; process scheduling queue system; distributed queue tree; dynamically partitionable parallel machines; nested; dynamically nested partitioning; time-sharing scheduling; interactive environment; processor utilization; process scheduling queues; round-robin scheduling algorithm; task allocation policies; simulation results; time-sharing; batch scheduling; high-load situations

Citation:

A. Hori, M. Maeda, Y. Ishikawa, T. Tomokiyo, H. Konaka, "A scalable time-sharing scheduling for partitionable distributed memory parallel machines," hicss, pp.173, 28th Hawaii International Conference on System Sciences (HICSS'95), 1995

Peer Review Notice | Give Us Feedback

Usage of this product signifies your acceptance of the Terms of Use.