Computer benchmarking: paths and pitfalls
IEEE Spectrum
Machine Characterization Based on an Abstract High-Level Language Machine
IEEE Transactions on Computers
Is it really possible to benchmark a supercomputer? A graded approach to performance measurement
Evaluating supercomputers
Semi-empirical multiprocessor performance predictions
Journal of Parallel and Distributed Computing
Exploiting process lifetime distributions for dynamic load balancing
ACM Transactions on Computer Systems (TOCS)
The art of computer programming, volume 3: (2nd ed.) sorting and searching
The art of computer programming, volume 3: (2nd ed.) sorting and searching
Future Generation Computer Systems - Special issue on metacomputing
Dhrystone: a synthetic systems programming benchmark
Communications of the ACM
A software architecture for user transparent parallel image processing
Parallel Computing - Parallel computing in image and video processing
Compile-Time Based Performance Prediction
LCPC '99 Proceedings of the 12th International Workshop on Languages and Compilers for Parallel Computing
Adaptive Computing on the Grid Using AppLeS
IEEE Transactions on Parallel and Distributed Systems
Model-Integrated Program Synthesis Environment
ECBS '96 Proceedings of the IEEE Symposium and Workshop on Engineering of Computer Based Systems
Models of parallel computation: a survey and synthesis
HICSS '95 Proceedings of the 28th Hawaii International Conference on System Sciences
Forecasting network performance to support dynamic scheduling using the network weather service
HPDC '97 Proceedings of the 6th IEEE International Symposium on High Performance Distributed Computing
The Amsterdam Library of Object Images
International Journal of Computer Vision
Predicting application run times with historical information
Journal of Parallel and Distributed Computing
User Transparent Parallel Processing of the 2004 NIST TRECVID Data Set
IPDPS '05 Proceedings of the 19th IEEE International Parallel and Distributed Processing Symposium (IPDPS'05) - Papers - Volume 01
Multimedia Tools and Applications
METERG: Measurement-Based End-to-End Performance Estimation Technique in QoS-Capable Multiprocessors
RTAS '06 Proceedings of the 12th IEEE Real-Time and Embedded Technology and Applications Symposium
The Semantic Pathfinder: Using an Authoring Metaphor for Generic Multimedia Indexing
IEEE Transactions on Pattern Analysis and Machine Intelligence
Predict task running time in grid environments based on CPU load predictions
Future Generation Computer Systems
On the Optimization of Resource Utilization in Distributed Multimedia Applications
CCGRID '08 Proceedings of the 2008 Eighth IEEE International Symposium on Cluster Computing and the Grid
Modeling "Just-in-Time" Communication in Distributed Real-Time Multimedia Applications
CCGRID '08 Proceedings of the 2008 Eighth IEEE International Symposium on Cluster Computing and the Grid
Load prediction using hybrid model for computational grid
GRID '07 Proceedings of the 8th IEEE/ACM International Conference on Grid Computing
Trace-based evaluation of job runtime and queue wait time predictions in grids
Proceedings of the 18th ACM international symposium on High performance distributed computing
Dynamic load balancing for a grid application
HiPC'04 Proceedings of the 11th international conference on High Performance Computing
Hi-index | 0.00 |
The research area of multimedia content analysis (MMCA) considers all aspects of the automated extraction of knowledge from multimedia archives and data streams. To adhere to strict time constraints, large-scale multimedia applications typically are being executed on distributed systems consisting of large collections of compute clusters. In a distributed scenario, it is first essential to determine the optimal number of compute nodes used by each cluster, properly balancing the complex tradeoff between computation and communication. This issue is referred as the "resource utilization" (RU) problem. Next, it is important to tune the transmission of newly generated data sent to each cluster, so as to obtain the highest service utilization, while minimizing the need for buffering. This latter issue is referred as the problem of "just-in-time" (JIT) communication. In this paper, we first present a simple and easy-to-implement method for the RU problem, which is based on the classical binary search method. Second, we address the JIT problem by introducing a smart adaptive control method that properly reacts to the continuously changing circumstances in distributed systems. Extensive experimental validation of the two approaches on a real distributed system shows that our optimization approaches are indeed highly effective.