Sciweavers

2226 search results - page 94 / 446
» Fault-Tolerant Parallel Applications with Dynamic Parallel S...
Sort
View
ICCS
2004
Springer
14 years 1 months ago
Using Runtime Measurements and Historical Traces for Acquiring Knowledge in Parallel Applications
Abstract. A new approach for acquiring knowledge of parallel applications regarding resource usage and for searching similarity on workload traces is presented. The main goal is to...
Luciano José Senger, Marcos José San...
SIGMETRICS
1999
ACM
14 years 4 days ago
Optimal Stochastic Scheduling in Multiclass Parallel Queues
In this paperweconsidertheproblemof schedulingdifferentclasses of customerson multiple distributed serversto minimize an objective function basedon per-classmeanresponsetimes.This...
Jay Sethuraman, Mark S. Squillante
IPPS
2002
IEEE
14 years 23 days ago
Scheduling Multiple Data Visualization Query Workloads on a Shared Memory Machine
Query scheduling plays an important role when systems are faced with limited resources and high workloads. It becomes even more relevant for servers applying multiple query optimi...
Henrique Andrade, Tahsin M. Kurç, Alan Suss...
ISPAN
1997
IEEE
14 years 1 days ago
CASS: an efficient task management system for distributed memory architectures
The thesis of this research is that the task of exposing the parallelism in a given application should be left to the algorithm designer, who has intimate knowledge of the applica...
Jing-Chiou Liou, Michael A. Palis
ICPP
1998
IEEE
14 years 3 days ago
A memory-layout oriented run-time technique for locality optimization
Exploiting locality at run-time is a complementary approach to a compiler approach for those applications with dynamic memory access patterns. This paper proposes a memory-layout ...
Yong Yan, Xiaodong Zhang, Zhao Zhang