Sciweavers

1520 search results - page 165 / 304
» The Ring Loading Problem
Sort
View
SPAA
2005
ACM
15 years 8 months ago
Dynamic circular work-stealing deque
The non-blocking work-stealing algorithm of Arora, Blumofe, and Plaxton (henceforth ABP work-stealing) is on its way to becoming the multiprocessor load balancing technology of ch...
David Chase, Yossi Lev
PDP
2003
IEEE
15 years 8 months ago
A Parallel Evolutionary Algorithm for Circuit Partitioning
As general-purpose parallel computers are increasingly being used to speed up different VLSI applications, the development of parallel algorithms for circuit testing, logic minimi...
Raul Baños, Consolación Gil, Maria D...
SWAT
1992
Springer
111views Algorithms» more  SWAT 1992»
15 years 7 months ago
Retrieval of scattered information by EREW, CREW and CRCW PRAMs
The k-compaction problem arises when k out of n cells in an array are non-empty and the contents of these cells must be moved to the first k locations in the array. Parallel algori...
Faith E. Fich, Miroslaw Kowaluk, Krzysztof Lorys, ...
BTW
2009
Springer
118views Database» more  BTW 2009»
15 years 6 months ago
Multi-Objective Scheduling for Real-Time Data Warehouses
: The issue of write-read contention is one of the most prevalent problems when deploying real-time data warehouses. With increasing load, updates are increasingly delayed and prev...
Maik Thiele, Andreas Bader, Wolfgang Lehner
JSAC
2008
98views more  JSAC 2008»
15 years 3 months ago
Randomized consensus algorithms over large scale networks
Suppose we have a directed graph G with set of nodes V = {1, . . . , N} and a measure xi for every node i V . The average consensus problem consists in computing the average xA = ...
Fabio Fagnani, Sandro Zampieri