Estimating Execution Time of Distributed Applications

Authors:
Maciej Drozdowski
Affiliations:
-
Venue:
PPAM '01 Proceedings of the th International Conference on Parallel Processing and Applied Mathematics-Revised Papers
Year:
2001

Citing 2
Cited 2

Introduction to algorithms

Introduction to algorithms
Scheduling computer and manufacturing processes

Scheduling computer and manufacturing processes

Feedback scheduling of real-time divisible loads in clusters

ACM SIGBED Review - Special issue on the the 14th IEEE real-time and embedded technology and applications symposium (RTAS'08) WIP session
Performance evaluation for object oriented software systems

ACM SIGSOFT Software Engineering Notes

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this work we consider the problem of estimating execution time of distributed applications. The main difficulty stems from the communication delays and shared nature of the computing and communication media. A simple method taking into account communications and concurrency of computations is proposed to estimate the execution time of a distributed application. The proposed technique is evaluated in a sequence of experiments. It is demonstrated that this method is feasible. Other interesting consequences are also outlined.