LPVM: A step towards multithread PVM

Honbo Zhou; Al Geist

doi:10.1002/(SICI)1096-9128(19980425)10:5<407::AID-CPE326>3.0.CO;2-6

LPVM: A step towards multithread PVM

Honbo Zhou, Al Geist

National Center for Computational Scienc

Research output: Contribution to journal › Article › peer-review

6 Scopus citations

Abstract

LPVM (lightweight-process PVM) is an experimental PVM version that supports the use of lightweight processes or threads as the basic unit of parallelism. It was designed to study potential performance improvements and implementation issues required by multithread messagepassing systems. The current version of LPVM was implemented on SMPs (shared memory processors) using POSIX threads and is designed to be thread-safe. Initial test results on a SUN SMP are compared with the performance of standard PVM. Task spawning is an order of magnitude faster in LPVM, but message-passing between threads using shared memory was found to be slower than standard PVM due to overheads in getting and releasing shared memory locks.

Original language	English
Pages (from-to)	407-416
Number of pages	10
Journal	Concurrency Practice and Experience
Volume	10
Issue number	5
DOIs	https://doi.org/10.1002/(SICI)1096-9128(19980425)10:5<407::AID-CPE326>3.0.CO;2-6
State	Published - Apr 25 1998

Access to Document

10.1002/(SICI)1096-9128(19980425)10:5<407::AID-CPE326>3.0.CO;2-6

Cite this

@article{761bc1f0e41b4c0eaf75db3f2e3549b3,

title = "LPVM: A step towards multithread PVM",

abstract = "LPVM (lightweight-process PVM) is an experimental PVM version that supports the use of lightweight processes or threads as the basic unit of parallelism. It was designed to study potential performance improvements and implementation issues required by multithread messagepassing systems. The current version of LPVM was implemented on SMPs (shared memory processors) using POSIX threads and is designed to be thread-safe. Initial test results on a SUN SMP are compared with the performance of standard PVM. Task spawning is an order of magnitude faster in LPVM, but message-passing between threads using shared memory was found to be slower than standard PVM due to overheads in getting and releasing shared memory locks.",

author = "Honbo Zhou and Al Geist",

year = "1998",

month = apr,

day = "25",

doi = "10.1002/(SICI)1096-9128(19980425)10:5<407::AID-CPE326>3.0.CO;2-6",

language = "English",

volume = "10",

pages = "407--416",

journal = "Concurrency Practice and Experience",

issn = "1040-3108",

number = "5",

}

TY - JOUR

T1 - LPVM

T2 - A step towards multithread PVM

AU - Zhou, Honbo

AU - Geist, Al

PY - 1998/4/25

Y1 - 1998/4/25

N2 - LPVM (lightweight-process PVM) is an experimental PVM version that supports the use of lightweight processes or threads as the basic unit of parallelism. It was designed to study potential performance improvements and implementation issues required by multithread messagepassing systems. The current version of LPVM was implemented on SMPs (shared memory processors) using POSIX threads and is designed to be thread-safe. Initial test results on a SUN SMP are compared with the performance of standard PVM. Task spawning is an order of magnitude faster in LPVM, but message-passing between threads using shared memory was found to be slower than standard PVM due to overheads in getting and releasing shared memory locks.

AB - LPVM (lightweight-process PVM) is an experimental PVM version that supports the use of lightweight processes or threads as the basic unit of parallelism. It was designed to study potential performance improvements and implementation issues required by multithread messagepassing systems. The current version of LPVM was implemented on SMPs (shared memory processors) using POSIX threads and is designed to be thread-safe. Initial test results on a SUN SMP are compared with the performance of standard PVM. Task spawning is an order of magnitude faster in LPVM, but message-passing between threads using shared memory was found to be slower than standard PVM due to overheads in getting and releasing shared memory locks.

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

U2 - 10.1002/(SICI)1096-9128(19980425)10:5<407::AID-CPE326>3.0.CO;2-6

DO - 10.1002/(SICI)1096-9128(19980425)10:5<407::AID-CPE326>3.0.CO;2-6

M3 - Article

AN - SCOPUS:0346544570

SN - 1040-3108

VL - 10

SP - 407

EP - 416

JO - Concurrency Practice and Experience

JF - Concurrency Practice and Experience

IS - 5

ER -

LPVM: A step towards multithread PVM

Abstract

Access to Document

Other files and links

Fingerprint

Cite this