Communicating sequential processes
Communicating sequential processes
Approximate Analysis of Fork/Join Synchronization in Parallel Queues
IEEE Transactions on Computers
Performance Analysis of Parallel Processing Systems
IEEE Transactions on Software Engineering
Scheduling in multiprogrammed parallel systems
SIGMETRICS '88 Proceedings of the 1988 ACM SIGMETRICS conference on Measurement and modeling of computer systems
Guide to parallel programming on Sequent computer systems: 2nd edition
Guide to parallel programming on Sequent computer systems: 2nd edition
Analysis of the Fork-Join Queue
IEEE Transactions on Computers
Acyclic fork-join queuing networks
Journal of the ACM (JACM)
Statistical analysis of parallel simulations
WSC '86 Proceedings of the 18th conference on Winter simulation
Computer Performance Modeling Handbook
Computer Performance Modeling Handbook
ADA Programming Language
Bounds for Two Server Fork-Join Queueing Systems
Bounds for Two Server Fork-Join Queueing Systems
Analysis of Fork-Join Jobs Using Processor-Sharing
Analysis of Fork-Join Jobs Using Processor-Sharing
Probability, Statistics, and Queueing Theory with Computer Science Applications
Probability, Statistics, and Queueing Theory with Computer Science Applications
Performance Evaluation of Parallel Systems by Using Unbounded Generalized Stochastic Petri Nets
IEEE Transactions on Software Engineering
Scheduling in parallel systems with a hierarchical organization of tasks
ICS '92 Proceedings of the 6th international conference on Supercomputing
A performance evaluation of several priority policies for parallel processing systems
Journal of the ACM (JACM)
A Hierarchical Task Queue Organization for Shared-Memory Multiprocessor Systems
IEEE Transactions on Parallel and Distributed Systems
Analysis of Processor Allocation in Multiprogrammed, Distributed-Memory Parallel Processing Systems
IEEE Transactions on Parallel and Distributed Systems
HCW '97 Proceedings of the 6th Heterogeneous Computing Workshop (HCW '97)
Simulation of Task Graph Systems in Heterogeneous Computing Environments
HCW '99 Proceedings of the Eighth Heterogeneous Computing Workshop
Parallel program performance prediction using deterministic task graph analysis
ACM Transactions on Computer Systems (TOCS)
Journal of Parallel and Distributed Computing
A solution for the MX/G/1-PS process response time
Operations Research Letters
| Hi-index | 0.00 |
Models for two processor sharing policies called task scheduling processor sharing and job scheduling processor sharing are developed and analyzed. The first policy schedules each task independently and allows parallel execution of an individual program, whereas the second policy schedules each job as a unit, thereby not allowing parallel execution of an individual program. It is found that task scheduling performs better than job scheduling for most system parameter values. The performance of the task scheduling processor sharing is compared to a first come first serve policy. First come first serve performs better than processor sharing over a wide range of system parameters. Processor sharing performs best when the task service time variability is high. The performance of processor sharing and first come first serve is studied with two classes of jobs, and for when a specific number of processors is statically assigned to each of the classes.