Sciweavers

3171 search results - page 12 / 635
» Application of Reduce Order Modeling to Time Parallelization
Sort
View
CRYPTO
2000
Springer
110views Cryptology» more  CRYPTO 2000»
14 years 1 days ago
Parallel Reducibility for Information-Theoretically Secure Computation
Secure Function Evaluation (SFE) protocols are very hard to design, and reducibility has been recognized as a highly desirable property of SFE protocols. Informally speaking, reduc...
Yevgeniy Dodis, Silvio Micali
HPDC
2010
IEEE
13 years 8 months ago
Twister: a runtime for iterative MapReduce
MapReduce programming model has simplified the implementation of many data parallel applications. The simplicity of the programming model and the quality of services provided by m...
Jaliya Ekanayake, Hui Li, Bingjing Zhang, Thilina ...
CCGRID
2002
IEEE
14 years 20 days ago
Using TOP-C and AMPIC to Port Large Parallel Applications to the Computational Grid
Porting large applications to distributed computing platforms is a challenging task from a software engineering perspective. The Computational Grid has gained tremendous popularit...
Gene Cooperman, Henri Casanova, Jim Hayes, Thomas ...
IPPS
2005
IEEE
14 years 1 months ago
Production Scheduling by Reachability Analysis - A Case Study
— Schedule synthesis based on reachability analysis of timed automata has received attention in the last few years. The main strength of this approach is that the expressiveness ...
Gerd Behrmann, Ed Brinksma, Martijn Hendriks, Ange...
GPC
2007
Springer
14 years 1 months ago
Server-Side Parallel Data Reduction and Analysis
Abstract. Geoscience analysis is currently limited by cumbersome access and manipulation of large datasets from remote sources. Due to their data-heavy and compute-light nature, th...
Daniel L. Wang, Charles S. Zender, Stephen F. Jenk...