Sciweavers

2432 search results - page 74 / 487
» Using simple abstraction to reinvent computing for paralleli...
Sort
View
ICANNGA
2007
Springer
141views Algorithms» more  ICANNGA 2007»
15 years 3 months ago
On Sum Coloring of Graphs with Parallel Genetic Algorithms
Abstract. Chromatic number, chromatic sum and chromatic sum number are important graph coloring characteristics. The paper proves that a parallel metaheuristic like the parallel ge...
Zbigniew Kokosinski, Krzysztof Kwarciany
HPDC
1998
IEEE
15 years 2 months ago
Matchmaking: Distributed Resource Management for High Throughput Computing
Conventional resource management systems use a system model to describe resources and a centralized scheduler to control their allocation. We argue that this paradigm does not ada...
Rajesh Raman, Miron Livny, Marvin H. Solomon
IPPS
2003
IEEE
15 years 3 months ago
Importance of SIMD Computation Reconsidered
In this paper, SIMD and MIMD solutions for the realtime database management problem of air traffic control are compared. A real-time database system is highly constrained in a mul...
Will C. Meilander, Johnnie W. Baker, Mingxian Jin
SIAMSC
2010
151views more  SIAMSC 2010»
14 years 8 months ago
An Inner-Outer Iteration for Computing PageRank
We present a new iterative scheme for PageRank computation. The algorithm is applied to the linear system formulation of the problem, using inner-outer stationary iterations. It is...
David F. Gleich, Andrew P. Gray, Chen Greif, Tracy...
PPOPP
2009
ACM
15 years 4 months ago
NePalTM: design and implementation of nested parallelism for transactional memory systems
Abstract. Transactional memory (TM) promises to simplify construction of parallel applications by allowing programmers to reason about interactions between concurrently executing c...
Haris Volos, Adam Welc, Ali-Reza Adl-Tabatabai, Ta...