Sciweavers

4889 search results - page 180 / 978
» A Refactoring Approach to Parallelism
Sort
View
WICON
2008
13 years 11 months ago
Exploiting parallel networks using dynamic channel scheduling
Many researchers have been focusing on the outcomes and consequences of the rapid increase and proliferation of mobile wireless technologies. If it is not already the case, it wil...
Lara B. Deek, Kevin C. Almeroth, Mike P. Wittie, K...
JEA
1998
133views more  JEA 1998»
13 years 10 months ago
A New Deterministic Parallel Sorting Algorithm with an Experimental Evaluation
We introduce a new deterministic parallel sorting algorithm based on the regular sampling approach. The algorithm uses only two rounds of regular all-to-all personalized communica...
David R. Helman, Joseph JáJá, David ...
EUROPAR
2009
Springer
14 years 3 months ago
A New Genetic Algorithm for Scheduling for Large Communication Delays
Abstract. In modern parallel and distributed systems, the time for exchanging data is usually larger than that for computing elementary operations. Consequently, these communicatio...
Johnatan E. Pecero, Denis Trystram, Albert Y. Zoma...
IDA
2011
Springer
13 years 5 months ago
A parallel, distributed algorithm for relational frequent pattern discovery from very large data sets
The amount of data produced by ubiquitous computing applications is quickly growing, due to the pervasive presence of small devices endowed with sensing, computing and communicatio...
Annalisa Appice, Michelangelo Ceci, Antonio Turi, ...
SC
2009
ACM
14 years 5 months ago
Scalable computing with parallel tasks
Recent and future parallel clusters and supercomputers use SMPs and multi-core processors as basic nodes, providing a huge amount of parallel resources. These systems often have h...
Jörg Dümmler, Thomas Rauber, Gudula R&uu...