An N-sequential execution method for parallel programs and its application to MGTP

Ryuzo Hasegawa, Hiroshi Fujita, Takehiro Nakata, Noriaki Chikara

Research output: Contribution to journalArticle

Abstract

An efficient parallel execution method is presented for parallel programs which create many tasks at runtime on parallel machines with N number of processing elements (PEs) available at any time. In this method, the number of tasks activated at the same time is limited to at most N, and the exceeding number of created tasks are suspended until they are allowed to be activated, thus being processed sequentially. A PE can request a task to another PE only when the set of executable tasks of the requesting PE is empty. A PE can transfer a task to another PE only when the latter requests it and the set of executable tasks of the requested PE is not empty. This effectively suppresses the communication overhead induced by the task transfers between PEs. Also, it allows tasks which should be better executed sequentially to stay on a single PE, while keeping the execution rate of tasks at every PE very high. We implemented the method for the parallel theorem proving system MGTP written in the concurrent programming language KL1 running on the parallel inference machine PIM/m (128PE) as well as the shared-memory parallel machine Cray SuperServer6400 (20PE). The results show remarkable reduction of communication overhead achieving significant speedup.

Original languageEnglish
Pages (from-to)240-246
Number of pages7
JournalResearch Reports on Information Science and Electrical Engineering of Kyushu University
Volume2
Issue number2
Publication statusPublished - Sep 1997

Fingerprint

Processing
Theorem proving
Communication
Computer programming languages
Data storage equipment

All Science Journal Classification (ASJC) codes

  • Hardware and Architecture
  • Engineering (miscellaneous)
  • Electrical and Electronic Engineering

Cite this

An N-sequential execution method for parallel programs and its application to MGTP. / Hasegawa, Ryuzo; Fujita, Hiroshi; Nakata, Takehiro; Chikara, Noriaki.

In: Research Reports on Information Science and Electrical Engineering of Kyushu University, Vol. 2, No. 2, 09.1997, p. 240-246.

Research output: Contribution to journalArticle

@article{76cdb643960d4c9daa299d86ef4da749,
title = "An N-sequential execution method for parallel programs and its application to MGTP",
abstract = "An efficient parallel execution method is presented for parallel programs which create many tasks at runtime on parallel machines with N number of processing elements (PEs) available at any time. In this method, the number of tasks activated at the same time is limited to at most N, and the exceeding number of created tasks are suspended until they are allowed to be activated, thus being processed sequentially. A PE can request a task to another PE only when the set of executable tasks of the requesting PE is empty. A PE can transfer a task to another PE only when the latter requests it and the set of executable tasks of the requested PE is not empty. This effectively suppresses the communication overhead induced by the task transfers between PEs. Also, it allows tasks which should be better executed sequentially to stay on a single PE, while keeping the execution rate of tasks at every PE very high. We implemented the method for the parallel theorem proving system MGTP written in the concurrent programming language KL1 running on the parallel inference machine PIM/m (128PE) as well as the shared-memory parallel machine Cray SuperServer6400 (20PE). The results show remarkable reduction of communication overhead achieving significant speedup.",
author = "Ryuzo Hasegawa and Hiroshi Fujita and Takehiro Nakata and Noriaki Chikara",
year = "1997",
month = "9",
language = "English",
volume = "2",
pages = "240--246",
journal = "Research Reports on Information Science and Electrical Engineering of Kyushu University",
issn = "1342-3819",
publisher = "Kyushu University, Faculty of Science",
number = "2",

}

TY - JOUR

T1 - An N-sequential execution method for parallel programs and its application to MGTP

AU - Hasegawa, Ryuzo

AU - Fujita, Hiroshi

AU - Nakata, Takehiro

AU - Chikara, Noriaki

PY - 1997/9

Y1 - 1997/9

N2 - An efficient parallel execution method is presented for parallel programs which create many tasks at runtime on parallel machines with N number of processing elements (PEs) available at any time. In this method, the number of tasks activated at the same time is limited to at most N, and the exceeding number of created tasks are suspended until they are allowed to be activated, thus being processed sequentially. A PE can request a task to another PE only when the set of executable tasks of the requesting PE is empty. A PE can transfer a task to another PE only when the latter requests it and the set of executable tasks of the requested PE is not empty. This effectively suppresses the communication overhead induced by the task transfers between PEs. Also, it allows tasks which should be better executed sequentially to stay on a single PE, while keeping the execution rate of tasks at every PE very high. We implemented the method for the parallel theorem proving system MGTP written in the concurrent programming language KL1 running on the parallel inference machine PIM/m (128PE) as well as the shared-memory parallel machine Cray SuperServer6400 (20PE). The results show remarkable reduction of communication overhead achieving significant speedup.

AB - An efficient parallel execution method is presented for parallel programs which create many tasks at runtime on parallel machines with N number of processing elements (PEs) available at any time. In this method, the number of tasks activated at the same time is limited to at most N, and the exceeding number of created tasks are suspended until they are allowed to be activated, thus being processed sequentially. A PE can request a task to another PE only when the set of executable tasks of the requesting PE is empty. A PE can transfer a task to another PE only when the latter requests it and the set of executable tasks of the requested PE is not empty. This effectively suppresses the communication overhead induced by the task transfers between PEs. Also, it allows tasks which should be better executed sequentially to stay on a single PE, while keeping the execution rate of tasks at every PE very high. We implemented the method for the parallel theorem proving system MGTP written in the concurrent programming language KL1 running on the parallel inference machine PIM/m (128PE) as well as the shared-memory parallel machine Cray SuperServer6400 (20PE). The results show remarkable reduction of communication overhead achieving significant speedup.

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

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

M3 - Article

AN - SCOPUS:5944219684

VL - 2

SP - 240

EP - 246

JO - Research Reports on Information Science and Electrical Engineering of Kyushu University

JF - Research Reports on Information Science and Electrical Engineering of Kyushu University

SN - 1342-3819

IS - 2

ER -