Sciweavers

161 search results - page 7 / 33
» GCA: A Massively Parallel Model
Sort
View
IPPS
2007
IEEE
14 years 1 months ago
Advanced Shortest Paths Algorithms on a Massively-Multithreaded Architecture
We present a study of multithreaded implementations of Thorup’s algorithm for solving the Single Source Shortest Path (SSSP) problem for undirected graphs. Our implementations l...
Joseph R. Crobak, Jonathan W. Berry, Kamesh Maddur...
IPPS
2003
IEEE
14 years 8 days ago
Multiple Instruction Stream Control for an Associative Model of Parallel Computation
This paper describes a system software design for multiple instruction stream control in a massively parallel associative computing environment. The purpose of providing multiple ...
Michael Scherger, Johnnie W. Baker, Jerry L. Potte...
CRYPTO
2011
Springer
195views Cryptology» more  CRYPTO 2011»
12 years 6 months ago
Time-Lock Puzzles in the Random Oracle Model
Abstract. A time-lock puzzle is a mechanism for sending messages “to the future”. The sender publishes a puzzle whose solution is the message to be sent, thus hiding it until e...
Mohammad Mahmoody, Tal Moran, Salil P. Vadhan
EGPGV
2004
Springer
143views Visualization» more  EGPGV 2004»
14 years 12 days ago
Massive Data Pre-Processing with a Cluster Based Approach
Data coming from complex simulation models reach easily dimensions much greater than available computational resources. Visualization of such data still represents the most intuit...
Rita Borgo, Valerio Pascucci, Roberto Scopigno
ICGA
1993
75views Optimization» more  ICGA 1993»
13 years 8 months ago
Structure and Performance of Fine-Grain Parallelism in Genetic Search
Within the parallel genetic algorithm framework, there currently exists a growing dichotomy between coarse-pain and fine-grain parallel architectures. This paper attempts to chara...
Shumeet Baluja