Sciweavers

6437 search results - page 589 / 1288
» Parallel Algorithms for Arrangements
Sort
View
PPOPP
2009
ACM
16 years 7 months ago
Idempotent work stealing
Load balancing is a technique which allows efficient parallelization of irregular workloads, and a key component of many applications and parallelizing runtimes. Work-stealing is ...
Maged M. Michael, Martin T. Vechev, Vijay A. Saras...
DAC
2005
ACM
16 years 8 months ago
Multi-threaded reachability
Partitioned BDD-based algorithms have been proposed in the literature to solve the memory explosion problem in BDD-based verification. Such algorithms can be at times ineffective ...
Debashis Sahoo, Jawahar Jain, Subramanian K. Iyer,...
VLDB
1991
ACM
143views Database» more  VLDB 1991»
15 years 10 months ago
Handling Data Skew in Multiprocessor Database Computers Using Partition Tuning
Shared nothing multiprocessor archit.ecture is known t.obe more scalable to support very large databases. Compared to other join strategies, a hash-ba9ed join algorithm is particu...
Kien A. Hua, Chiang Lee
CONCUR
2010
Springer
15 years 8 months ago
Reasoning about Optimistic Concurrency Using a Program Logic for History
Optimistic concurrency algorithms provide good performance for parallel programs but they are extremely hard to reason about. Program logics such as concurrent separation logic and...
Ming Fu, Yong Li, Xinyu Feng, Zhong Shao, Yu Zhang
GECCO
2008
Springer
139views Optimization» more  GECCO 2008»
15 years 8 months ago
Voronoi-initializated island models for solving real-coded deceptive problems
Deceptive problems have always been considered difficult for Genetic Algorithms. To cope with this characteristic, the literature has proposed the use of Parallel Genetic Algorith...
Santiago Muelas, José Manuel Peña, V...