Analysis of fork-join program response times on multiprocessors

Journal Article · Sun Jul 01 04:00:00 EDT 1990 · IEEE Transactions on Parallel and Distributed Systems; (USA)

DOI:https://doi.org/10.1109/71.80157· OSTI ID:6445872

Towsley, D; Stankovic, J A ^[1]; Rommel, C G ^[2]

---

1. Massachusetts Univ., Amherst, MA (USA). Dept. of Computer and Information Science
2. Eastern Connecticut State Univ., Willimatic, CT (US)

In this paper, the authors develop analytic models for a shared memory multiprocessor that executes fork-join parallel programs. Here a fork-join program is one that consists of a set of n {ge} 1 parallel tasks. All of the tasks of a program arrive simultaneously to the system and the job is assumed to complete when the last task completes. They develop and analyze models for two processor sharing policies, called task scheduling processor sharing and job scheduling processor sharing. The first policy schedules tasks independently of each other and allows parallel execution of an individual program, whereas the second policy schedules each job as a unit and thereby does not allow parallel execution of an individual program.

• OSTI ID: 6445872
• Journal Information: IEEE Transactions on Parallel and Distributed Systems; (USA), Journal Name: IEEE Transactions on Parallel and Distributed Systems; (USA) Vol. 1:3; ISSN ITDSE; ISSN 1045-9219
• Country of Publication: United States
• Language: English

Related Subjects

99 GENERAL AND MISCELLANEOUS
990200* -- Mathematics & Computers
ANALYTICAL SOLUTION
ARRAY PROCESSORS
COMPUTER CODES
DATA PROCESSING
DESIGN
MEMORY DEVICES
PARALLEL PROCESSING
PERFORMANCE
PROCESSING
PROGRAMMING
TASK SCHEDULING