Sciweavers

234 search results - page 23 / 47
» Sorting and Selection on Distributed Memory Bus Computers
Sort
View
IPPS
1999
IEEE
14 years 28 days ago
Reducing I/O Complexity by Simulating Coarse Grained Parallel Algorithms
Block-wise access to data is a central theme in the design of efficient external memory (EM) algorithms. A second important issue, when more than one disk is present, is fully par...
Frank K. H. A. Dehne, David A. Hutchinson, Anil Ma...
EUC
2007
Springer
14 years 2 months ago
Attack-Resilient Random Key Distribution Scheme for Distributed Sensor Networks
Abstract. Key pre-distribution schemes are a favored solution for establishing secure communication in sensor networks. Often viewed as the safest way to bootstrap trust, the main ...
Firdous Kausar, Sajid Hussain, Tai-Hoon Kim, Ashra...
NPC
2010
Springer
13 years 7 months ago
Vectorization for Java
Java is one of the most popular programming languages in today’s software development, but the adoption of Java in some areas like high performance computing, gaming, and media p...
Jiutao Nie, Buqi Cheng, Shisheng Li, Ligang Wang, ...
DAC
2003
ACM
14 years 1 months ago
Improved indexing for cache miss reduction in embedded systems
The increasing use of microprocessor cores in embedded systems as well as mobile and portable devices creates an opportunity for customizing the cache subsystem for improved perfo...
Tony Givargis
SPAA
2003
ACM
14 years 1 months ago
Relaxing the problem-size bound for out-of-core columnsort
Previous implementations of out-of-core columnsort limit the problem size to N ≤ (M/P)3/2, where N is the number of records to sort, P is the number of processors, and M is the ...
Geeta Chaudhry, Elizabeth A. Hamon, Thomas H. Corm...