Sciweavers

232 search results - page 16 / 47
» A Message Ordering Problem in Parallel Programs
Sort
View
146
Voted
HICSS
2003
IEEE
200views Biometrics» more  HICSS 2003»
15 years 7 months ago
A Dynamic Assignment Problem in a Mobile System with Limited Bandwidth
The assignment problem originally arising from parallel and distributed computing has been investigated intensively since the 70’s when Harold Stone proposed a method to solve i...
Yang Wang 0006, Thomas Kunz
IPPS
2005
IEEE
15 years 8 months ago
Automatic Support for Irregular Computations in a High-Level Language
The problem of writing high performance parallel applications becomes even more challenging when irregular, sparse or adaptive methods are employed. In this paper we introduce com...
Jimmy Su, Katherine A. Yelick
AAAI
2008
15 years 4 months ago
H-DPOP: Using Hard Constraints for Search Space Pruning in DCOP
In distributed constraint optimization problems, dynamic programming methods have been recently proposed (e.g. DPOP). In dynamic programming many valuations are grouped together i...
Akshat Kumar, Adrian Petcu, Boi Faltings
JVA
2006
IEEE
15 years 8 months ago
Programming Models for Grid Applications and Systems: Requirements and Approaches
History repeats itself. Since the invention of the programmable computer, numerous computer scientists keep dedicating their professional lives to the design of “the single, bes...
Thilo Kielmann
IPPS
2010
IEEE
15 years 7 days ago
Highly scalable parallel sorting
Sorting is a commonly used process with a wide breadth of applications in the high performance computing field. Early research in parallel processing has provided us with comprehen...
Edgar Solomonik, Laxmikant V. Kalé