A static scheduling system for a parallel machine (SM)2-II

Ling Xiao-Ping, Hideharu Amano

Research output: Chapter in Book/Report/Conference proceedingConference contribution

4 Citations (Scopus)

Abstract

(SM)2-II (Sparse Matrix Solving Machine II) is a large scale multiprocessor for widespread use in scientific computation. In this machine, problems are described in a concurrent process language. (SM)2-II is designed so as to manage a large number of small concurrent processes effectively. However, if the granularity of the processes is fine and the number of processes becomes great, the overhead of process switching and communication bottlenecks the machine. If these processes are statically scheduled before execution, the overhead of process control can be greatly reduced. In this paper, a static scheduling system for concurrent processes is proposed. Using this system, processes are scheduled statically and merged into a smaller number of processes, according to the number of processing units. In the most successful case, no operating system is necessary. In general, exactly optimized scheduling is an NP-complete problem. In our system, a practical optimization algorithm named LS-M (Level Scheduling with Merging) is utilized. Using LS-M, semi-optimized results can be obtained within a practical execution time. Some examples, including ordinary differential and simultaneously linear equations and expert systems written in OPS5, are used to evaluate the scheduling system.

Original languageEnglish
Title of host publicationPARLE 1989
Subtitle of host publicationParallel Architectures and Languages Europe - Parallel Languages, Proceedings
PublisherSpringer Verlag
Pages118-135
Number of pages18
Volume365 LNCS
ISBN (Print)9783540512844
DOIs
Publication statusPublished - 1989
Event2nd International Conference on Parallel Architectures and Languages Europe, PARLE 1989 - Eindhoven, Netherlands
Duration: 1989 Jun 121989 Jun 16

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume365 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Other

Other2nd International Conference on Parallel Architectures and Languages Europe, PARLE 1989
CountryNetherlands
CityEindhoven
Period89/6/1289/6/16

Fingerprint

Parallel Machines
Scheduling
Merging
Concurrent
Linear equations
Expert systems
Process control
Computational complexity
Sparse matrix
Multiprocessor
Expert System
Granularity
Communication
Process Control
Operating Systems
Processing
Execution Time
Linear equation
Optimization Algorithm
NP-complete problem

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Computer Science(all)

Cite this

Xiao-Ping, L., & Amano, H. (1989). A static scheduling system for a parallel machine (SM)2-II. In PARLE 1989: Parallel Architectures and Languages Europe - Parallel Languages, Proceedings (Vol. 365 LNCS, pp. 118-135). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 365 LNCS). Springer Verlag. https://doi.org/10.1007/3540512845_36

A static scheduling system for a parallel machine (SM)2-II. / Xiao-Ping, Ling; Amano, Hideharu.

PARLE 1989: Parallel Architectures and Languages Europe - Parallel Languages, Proceedings. Vol. 365 LNCS Springer Verlag, 1989. p. 118-135 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 365 LNCS).

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Xiao-Ping, L & Amano, H 1989, A static scheduling system for a parallel machine (SM)2-II. in PARLE 1989: Parallel Architectures and Languages Europe - Parallel Languages, Proceedings. vol. 365 LNCS, Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 365 LNCS, Springer Verlag, pp. 118-135, 2nd International Conference on Parallel Architectures and Languages Europe, PARLE 1989, Eindhoven, Netherlands, 89/6/12. https://doi.org/10.1007/3540512845_36
Xiao-Ping L, Amano H. A static scheduling system for a parallel machine (SM)2-II. In PARLE 1989: Parallel Architectures and Languages Europe - Parallel Languages, Proceedings. Vol. 365 LNCS. Springer Verlag. 1989. p. 118-135. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)). https://doi.org/10.1007/3540512845_36
Xiao-Ping, Ling ; Amano, Hideharu. / A static scheduling system for a parallel machine (SM)2-II. PARLE 1989: Parallel Architectures and Languages Europe - Parallel Languages, Proceedings. Vol. 365 LNCS Springer Verlag, 1989. pp. 118-135 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).
@inproceedings{1aa93bc8facb408a90fab4b5bccfee57,
title = "A static scheduling system for a parallel machine (SM)2-II",
abstract = "(SM)2-II (Sparse Matrix Solving Machine II) is a large scale multiprocessor for widespread use in scientific computation. In this machine, problems are described in a concurrent process language. (SM)2-II is designed so as to manage a large number of small concurrent processes effectively. However, if the granularity of the processes is fine and the number of processes becomes great, the overhead of process switching and communication bottlenecks the machine. If these processes are statically scheduled before execution, the overhead of process control can be greatly reduced. In this paper, a static scheduling system for concurrent processes is proposed. Using this system, processes are scheduled statically and merged into a smaller number of processes, according to the number of processing units. In the most successful case, no operating system is necessary. In general, exactly optimized scheduling is an NP-complete problem. In our system, a practical optimization algorithm named LS-M (Level Scheduling with Merging) is utilized. Using LS-M, semi-optimized results can be obtained within a practical execution time. Some examples, including ordinary differential and simultaneously linear equations and expert systems written in OPS5, are used to evaluate the scheduling system.",
author = "Ling Xiao-Ping and Hideharu Amano",
year = "1989",
doi = "10.1007/3540512845_36",
language = "English",
isbn = "9783540512844",
volume = "365 LNCS",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
publisher = "Springer Verlag",
pages = "118--135",
booktitle = "PARLE 1989",
address = "Germany",

}

TY - GEN

T1 - A static scheduling system for a parallel machine (SM)2-II

AU - Xiao-Ping, Ling

AU - Amano, Hideharu

PY - 1989

Y1 - 1989

N2 - (SM)2-II (Sparse Matrix Solving Machine II) is a large scale multiprocessor for widespread use in scientific computation. In this machine, problems are described in a concurrent process language. (SM)2-II is designed so as to manage a large number of small concurrent processes effectively. However, if the granularity of the processes is fine and the number of processes becomes great, the overhead of process switching and communication bottlenecks the machine. If these processes are statically scheduled before execution, the overhead of process control can be greatly reduced. In this paper, a static scheduling system for concurrent processes is proposed. Using this system, processes are scheduled statically and merged into a smaller number of processes, according to the number of processing units. In the most successful case, no operating system is necessary. In general, exactly optimized scheduling is an NP-complete problem. In our system, a practical optimization algorithm named LS-M (Level Scheduling with Merging) is utilized. Using LS-M, semi-optimized results can be obtained within a practical execution time. Some examples, including ordinary differential and simultaneously linear equations and expert systems written in OPS5, are used to evaluate the scheduling system.

AB - (SM)2-II (Sparse Matrix Solving Machine II) is a large scale multiprocessor for widespread use in scientific computation. In this machine, problems are described in a concurrent process language. (SM)2-II is designed so as to manage a large number of small concurrent processes effectively. However, if the granularity of the processes is fine and the number of processes becomes great, the overhead of process switching and communication bottlenecks the machine. If these processes are statically scheduled before execution, the overhead of process control can be greatly reduced. In this paper, a static scheduling system for concurrent processes is proposed. Using this system, processes are scheduled statically and merged into a smaller number of processes, according to the number of processing units. In the most successful case, no operating system is necessary. In general, exactly optimized scheduling is an NP-complete problem. In our system, a practical optimization algorithm named LS-M (Level Scheduling with Merging) is utilized. Using LS-M, semi-optimized results can be obtained within a practical execution time. Some examples, including ordinary differential and simultaneously linear equations and expert systems written in OPS5, are used to evaluate the scheduling system.

UR - http://www.scopus.com/inward/record.url?scp=85027148415&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=85027148415&partnerID=8YFLogxK

U2 - 10.1007/3540512845_36

DO - 10.1007/3540512845_36

M3 - Conference contribution

SN - 9783540512844

VL - 365 LNCS

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 118

EP - 135

BT - PARLE 1989

PB - Springer Verlag

ER -