Portland State University. Department of Electrical Engineering
Michael A. Driscoll
Date of Award
Master of Science (M.S.) in Electrical and Computer Engineering
1 online resource (70 p.)
Parallel programming (Computer science) -- Mathematical models, Computer algorithms
The goal of parallel processing is to achieve high speed computing by partitioning a program into concurrent parts, assigning them in an efficient way to the available processors, scheduling the program and then executing the concurrent parts simultaneously. In the past researchers have combined the allocation of tasks in a program and scheduling of those tasks into one operation. We define scheduling as a process of efficiently assigning priorities to the already allocated tasks in a program. Assignment of priorities is important in cases when more than one task at a processor is ready for execution. Most heuristics for scheduling consider certain parameters of the architecture and the program. These parameters could be the execution time of each operation in a program, the number of processors, etc. The impact of ignoring interprocessor communication (IPC) when ordering parallel tasks has, however, not been well studied.
Patwardhan, Chintamani M., "Ignoring interprocessor communication during scheduling" (1992). Dissertations and Theses. Paper 4422.