Sciweavers

953 search results - page 62 / 191
» Using Clustering and Blade Clusters in the Terabyte Task
Sort
View
WOSP
2000
ACM
15 years 2 months ago
Analytic modeling of load balancing policies for tasks with heavy-tailed distributions
We present an analytic technique for modeling load balancing policies on a cluster of servers conditioned on the fact that the service times of arriving tasks are drawn from heavy...
Alma Riska, Evgenia Smirni, Gianfranco Ciardo
EUROPAR
2004
Springer
15 years 3 months ago
Task-Queue Based Hybrid Parallelism: A Case Study
Abstract. In this paper we report on our experiences with hybrid parallelism in PARDISO, a high-performance sparse linear solver. We start with the OpenMP-parallel numerical factor...
Karl Fürlinger, Olaf Schenk, Michael Hagemann
VIS
2004
IEEE
166views Visualization» more  VIS 2004»
15 years 11 months ago
2D Maps for Visual Analysis and Retrieval in Large Multi-Feature 3D Model Databases
Multimedia objects are often described by high-dimensional feature vectors which can be used for retrieval and clustering tasks. We have built an interactive retrieval system for ...
Benjamin Bustos, Daniel A. Keim, Christian Panse, ...
EURODAC
1995
IEEE
128views VHDL» more  EURODAC 1995»
15 years 1 months ago
Closeness metrics for system-level functional partitioning
An important system design task is the partitioning of system functionality for implementation among multiple system components, including partitions among hardware and software c...
Frank Vahid, Daniel D. Gajski
IJHPCA
2006
114views more  IJHPCA 2006»
14 years 9 months ago
Fault-Tolerant Scheduling of Fine-Grained Tasks in Grid Environments
Divide-and-conquer is a well-suited programming paradigm for parallel Grid applications. Our Satin system efficiently schedules the finegrained tasks of a divide-and-conquer appli...
Gosia Wrzesinska, Rob van Nieuwpoort, Jason Maasse...