Sciweavers

2593 search results - page 222 / 519
» Algorithms and Data Structures for Computer Topology
Sort
View
SPAA
1990
ACM
15 years 10 months ago
Parallel Algorithms for Arrangements
We give the first efficient parallel algorithms for solving the arrangement problem. We give a deterministic algorithm for the CREW PRAM which runs in nearly optimal bounds of O(lo...
Richard J. Anderson, Paul Beame, Erik Brisson
GCC
2005
Springer
16 years 7 days ago
Incorporating Data Movement into Grid Task Scheduling
Task Scheduling is a critical design issue of distributed computing. The emerging Grid computing infrastructure consists of heterogeneous resources in widely distributed autonomous...
Xiaoshan He, Xian-He Sun
IPPS
2005
IEEE
16 years 9 days ago
An Experimental Study of Parallel Biconnected Components Algorithms on Symmetric Multiprocessors (SMPs)
We present an experimental study of parallel biconnected components algorithms employing several fundamental parallel primitives, e.g., prefix sum, list ranking, sorting, connect...
Guojing Cong, David A. Bader
IJVR
2008
111views more  IJVR 2008»
15 years 6 months ago
Improve a Game Board based on Cultural Algorithms
Evolutionary computation is a generic term used to make reference to the solution of computational problems planned and implemented based on models of an evolutionary process. Most...
Alberto Ochoa, Alejandro Padilla, Saúl Gonz...
178
Voted
IPPS
2010
IEEE
15 years 4 months ago
Consistency in hindsight: A fully decentralized STM algorithm
Abstract--Software transactional memory (STM) algorithms often rely on centralized components to achieve atomicity, isolation and consistency. In a distributed setting, centralized...
Annette Bieniusa, Thomas Fuhrmann