Parallel computation using limited resources
Thesis/Dissertation
·
OSTI ID:5310454
This thesis addresses itself to the task of designing and analyzing parallel algorithms when the resources of processors, communication, and time are limited. The two parts of this thesis deal with multiprocessor systems and VLSI - the two important parallel processing environments that are prevalent today. In the first part a time-processor-communication tradeoff analysis is conducted for two kinds of problems - N input, 1 output, and N input, N output computations. In the class of problems of the second kind, the problem of prefix computation, an important problem due to the number of naturally occurring computations it can model, is studied. Finally, a general methodology is given for design of parallel algorithms that can be used to optimize a given design to a wide set of architectural variations. The second part of the thesis considers the design of parallel algorithms for the VLSI model of computation when the resource of time is severely restricted.
- Research Organization:
- Massachusetts Univ., Amherst (USA)
- OSTI ID:
- 5310454
- Country of Publication:
- United States
- Language:
- English
Similar Records
Mapping of algorithms into mesh connected computers
Fast and area-efficient VLSI adders
Complexity results in VLSI and distributed computing
Book
·
Tue Dec 31 23:00:00 EST 1985
·
OSTI ID:7157601
Fast and area-efficient VLSI adders
Thesis/Dissertation
·
Wed Dec 31 23:00:00 EST 1986
·
OSTI ID:6355081
Complexity results in VLSI and distributed computing
Thesis/Dissertation
·
Mon Dec 31 23:00:00 EST 1984
·
OSTI ID:5874986