Sciweavers

1497 search results - page 49 / 300
» A Computational Model for Message Passing
Sort
View
IPPS
2005
IEEE
15 years 11 months ago
PDM Sorting Algorithms That Take A Small Number of Passes
We live in an era of data explosion that necessitates the discovery of novel out-of-core techniques. The I/O bottleneck has to be dealt with in developing out-of-core methods. The...
Sanguthevar Rajasekaran, Sandeep Sen
CCGRID
2008
IEEE
15 years 8 months ago
Fault Tolerance in Cluster Federations with O2P-CF
Fault tolerance is one of the key issues for large scale applications executed on high performance computing systems. In a cluster federation, clusters are gathered to provide hug...
Thomas Ropars, Christine Morin
CRYPTO
2005
Springer
125views Cryptology» more  CRYPTO 2005»
15 years 11 months ago
Secure Computation Without Authentication
In the setting of secure multiparty computation, a set of parties wish to jointly compute some function of their inputs. Such a computation must preserve certain security propertie...
Boaz Barak, Ran Canetti, Yehuda Lindell, Rafael Pa...
CLUSTER
2003
IEEE
15 years 11 months ago
Communication Middleware Systems for Heterogenous Clusters: A Comparative Study
This paper presents a comparative study of the communication middleware systems suitable for aggregating computational clusters with heterogeneous incompatible SANs into a common ...
Daniel Balkanski, Mario Trams, Wolfgang Rehm
ICPPW
2006
IEEE
16 years 1 days ago
Performance Analysis of a Parallel Discrete Model for the Simulation of Laser Dynamics
This paper presents an analysis on the performance of a parallel implementation of a discrete model of laser dynamics, which is based on cellular automata. The performance of a 2D...
Jose Luis Guisado, Francisco Fernández de V...