ACM Transactions on Computer Systems (TOCS)
Quantitative system performance: computer system analysis using queueing network models
Quantitative system performance: computer system analysis using queueing network models
Optimal allocation of resources in distributed information networks
ACM Transactions on Database Systems (TODS) - Special issue: papers from the international conference on very large data bases: September 22–24, 1975, Framingham, MA
A Survey of Some Theoretical Aspects of Multiprocessing
ACM Computing Surveys (CSUR)
Concurrency Control in Distributed Database Systems
ACM Computing Surveys (CSUR)
Comparative Models of the File Assignment Problem
ACM Computing Surveys (CSUR)
The impact of distributions and disciplines on multiple processor systems
Communications of the ACM
Models for parallel processing within programs: application to CPU: I/O and I/O: I/O overlap
Communications of the ACM
Computer Performance Modeling Handbook
Computer Performance Modeling Handbook
Probability and Statistics with Reliability, Queuing and Computer Science Applications
Probability and Statistics with Reliability, Queuing and Computer Science Applications
Petri Net Theory and the Modeling of Systems
Petri Net Theory and the Modeling of Systems
Queueing Network Models to Estimate Serialization Delays in Computer Systems
Performance '83 Proceedings of the 9th International Symposium on Computer Performance Modelling, Measurement and Evaluation
A decomposition solution to the queueing network model of the centralized DBMS with static locking
SIGMETRICS '83 Proceedings of the 1983 ACM SIGMETRICS conference on Measurement and modeling of computer systems
A queueing network approach to the module allocation problem in distributed systems
SIGMETRICS '81 Proceedings of the 1981 ACM SIGMETRICS conference on Measurement and modeling of computer systems
The behavior of Ethernet-like computer communications networks
SOSP '79 Proceedings of the seventh ACM symposium on Operating systems principles
A Task Allocation Model for Distributed Computing Systems
IEEE Transactions on Computers
Experiences with Performance Measurement and Modeling of a Processor Array
IEEE Transactions on Computers
Analytic Queueing Models for Programs with Internal Concurrency
IEEE Transactions on Computers
Performance Analysis Using Stochastic Petri Nets
IEEE Transactions on Computers
Queueing Network Models for Parallel Processing with Asynchronous Tasks
IEEE Transactions on Computers
The Effect on Throughput of Multiprocessing in a Multiprogramming Environment
IEEE Transactions on Computers
Event-based performance perturbation: a case study
PPOPP '91 Proceedings of the third ACM SIGPLAN symposium on Principles and practice of parallel programming
The CAEDE performance analysis tool
SETA1 Proceedings of the first international symposium on Environments and tools for Ada
Stochastic Modeling and Analysis of Propagation Delays in GaAs Adders
IEEE Transactions on Computers
Performance Evaluation of Parallel Systems by Using Unbounded Generalized Stochastic Petri Nets
IEEE Transactions on Software Engineering
Multiple feedback queue as a model of general purpose multiprocessor systems
CSC '92 Proceedings of the 1992 ACM annual conference on Communications
The mathematics of product form queuing networks
ACM Computing Surveys (CSUR)
The influence of random delays on parallel execution times
SIGMETRICS '93 Proceedings of the 1993 ACM SIGMETRICS conference on Measurement and modeling of computer systems
Approximate mean value analysis of client-server systems with multi-class requests
SIGMETRICS '94 Proceedings of the 1994 ACM SIGMETRICS conference on Measurement and modeling of computer systems
Sufficient Conditions for Existence of a Fixed Point in Stochastic Reward Net-Based Iterative Models
IEEE Transactions on Software Engineering - Special issue: best papers of the sixth international workshop on Petri nets and performance models (PNPM'95)
Static Assignment of Stochastic Tasks Using Majorization
IEEE Transactions on Computers
On Performance Prediction of Parallel Computations with Precedent Constraints
IEEE Transactions on Parallel and Distributed Systems
The Circulating Processor Model of Parallel Systems
IEEE Transactions on Computers
Predicting Performance of Parallel Computations
IEEE Transactions on Parallel and Distributed Systems
A Three-View Model for Performance Engineering of Concurrent Software
IEEE Transactions on Software Engineering
Using Disk Throughput Data in Predictions of End-to-End Grid Data Transfers
GRID '02 Proceedings of the Third International Workshop on Grid Computing
Predicting the Performance of Wide Area Data Transfers
IPDPS '02 Proceedings of the 16th International Parallel and Distributed Processing Symposium
Performance Prediction for Complex Parallel Applications
IPPS '97 Proceedings of the 11th International Symposium on Parallel Processing
Compiler Synthesis of Task Graphs for Parallel Program Performance Prediction
LCPC '00 Proceedings of the 13th International Workshop on Languages and Compilers for Parallel Computing-Revised Papers
Interval-Based Performance Analysis of Computing Systems
MASCOTS '95 Proceedings of the 3rd International Workshop on Modeling, Analysis, and Simulation of Computer and Telecommunication Systems
Performance Analysis of Database Systems
Performance Evaluation: Origins and Directions
Software Performance Evaluation by Models
Performance Evaluation: Origins and Directions
Characterization and Analysis of Software and Computer Systems with Uncertainties and Variabilities
Performance Engineering, State of the Art and Current Trends
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
Task partitionings for parallel triangular solver on a MIMD computer
HPDC '96 Proceedings of the 5th IEEE International Symposium on High Performance Distributed Computing
Predicting Sporadic Grid Data Transfers
HPDC '02 Proceedings of the 11th IEEE International Symposium on High Performance Distributed Computing
Parallel program performance prediction using deterministic task graph analysis
ACM Transactions on Computer Systems (TOCS)
Parallel application performance on shared high performance reconfigurable computing resources
Performance Evaluation - Performance modelling and evaluation of high-performance parallel and distributed systems
Using Regression Techniques to Predict Large Data Transfers
International Journal of High Performance Computing Applications
Low-Cost Static Performance Prediction of Parallel Stochastic Task Compositions
IEEE Transactions on Parallel and Distributed Systems
Task assignment heuristics for parallel and distributed CFD applications
International Journal of Computational Science and Engineering
Parallel execution time prediction of the multitask parallel programs
Performance Evaluation
Roofline: an insightful visual performance model for multicore architectures
Communications of the ACM - A Direct Path to Dependable Software
| Hi-index | 14.99 |
This paper is concerned with the performance evaluation of a realistic model of parallel computations. We present an efficient algorithm to determine the mean completion time and related performance measures for a task system: a set of tasks with precedence relationships in their execution sequence, such that the resulting graph is acyclic. A queueing network (QN) is used to model tasks executing on a single or multicomputer system. In the case of multicomputer systems, we take into account the delay due to interprocess communication. A straight- forward application of a QN solver to the problem is not possible due to variations in the state of the system (composition of tasks in execution). An accurate algorithm based on hierarchical decomposition is presented for solving task systems. At the higher level, the system behavior is specified by a Markov chain whose states correspond to the combination of tasks in execution. The state transition rate matrix for the Markov chain is triangular (since the task system graph was assumed to be acyclic), therefore it can be solved efficiently to compute the state probabilities and the task initiation/completion times. At the lower level, the transition rates among the states of the Markov chain are computed using a QN solver, which determines the throughput of the computer system for each system state. The model and the solution method can be used in performance evaluation of applications exhibiting concurrency in centralized/distributed systems where there are conflicting goals of load balancing and minimizing interprocess communication overhead.