Sciweavers

79 search results - page 12 / 16
» Load Balancing of Parallelized Information Filters
Sort
View
MST
2000
57views more  MST 2000»
13 years 8 months ago
On Scheduling Parallel Tasks at Twilight
We consider the problem of processing a given number of tasks on a given number of processors as quickly as possible when only vague information about the processing time of a task...
Hannah Bast
PDP
2008
IEEE
14 years 3 months ago
Just-In-Time Scheduling for Loop-based Speculative Parallelization
Scheduling for speculative parallelization is a problem that remained unsolved despite its importance. Simple methods such as Fixed-Size Chunking (FSC) need several ‘dry-runs’...
Diego R. Llanos Ferraris, David Orden, Belé...
CONCURRENCY
2000
123views more  CONCURRENCY 2000»
13 years 8 months ago
A mobile agent based push methodology for global parallel computing
The 1990s are seeing the explosive growth of the Internet and Web-based information sharing and dissemination systems. The Internet is also showing a potential of forming of a sup...
Cheng-Zhong Xu, Brian Wims
SIGMOD
2012
ACM
253views Database» more  SIGMOD 2012»
11 years 11 months ago
Skew-aware automatic database partitioning in shared-nothing, parallel OLTP systems
The advent of affordable, shared-nothing computing systems portends a new class of parallel database management systems (DBMS) for on-line transaction processing (OLTP) applicatio...
Andrew Pavlo, Carlo Curino, Stanley B. Zdonik
DAIS
2003
13 years 10 months ago
Rational Server Selection for Mobile Agents
- Mobile agents have the ability to migrate through heterogeneous networks and execute at remote hosts. This ability can be exploited to improve the performance of agent based appl...
Carsten Pils, Stefan Diepolder