Sökning: 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 (författare)
-
Lennerstad, Håkan (författare)
- ISBN 0897916654
- Manchester : ACM; NY, USA, 1994
- 1994
- Engelska.
- Relaterad länk:
-
https://urn.kb.se/re...
Abstract
Ämnesord
Stäng
- 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
Ämnesord
- 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)
Nyckelord
- computational complexity
- parallel machines
- parallel programming
- scheduling
Publikations- och innehållstyp
- ref (ämneskategori)
- kon (ämneskategori)
Hitta via bibliotek
Till lärosätets databas