Search: onr:"swepub:oai:DiVA.org:bth-9923" >
An Optimal Upper Bo...
An Optimal Upper Bound on the Minimal Completion Time in Distributed Supercomputing
-
Lundberg, Lars (author)
-
Lennerstad, Håkan (author)
- ISBN 0897916654
- Manchester : ACM; NY, USA, 1994
- 1994
- English.
- Related links:
-
https://urn.kb.se/re...
Abstract
Subject headings
Close
- We first consider an MIMD multiprocessor configuration with n processors. A parallel program, consisting of n processes, is executed on this system-one process per processor. The program terminates when all processes are completed. Due to synchronizations, processes may be blocked waiting for events in other processes. Associated with the program is a parallel profile vector nu , index i (1
Subject headings
- NATURVETENSKAP -- Matematik -- Matematisk analys (hsv//swe)
- NATURAL SCIENCES -- Mathematics -- Mathematical Analysis (hsv//eng)
- NATURVETENSKAP -- Data- och informationsvetenskap -- Datavetenskap (hsv//swe)
- NATURAL SCIENCES -- Computer and Information Sciences -- Computer Sciences (hsv//eng)
Keyword
- computational complexity
- parallel machines
- parallel programming
- scheduling
Publication and Content Type
- ref (subject category)
- kon (subject category)
Find in a library
To the university's database