Sciweavers

2799 search results - page 162 / 560
» computing 1998
Sort
View
IPPS
1998
IEEE
15 years 7 months ago
Runtime Support for Virtual BSP Computer
Abstract. Several computing environments including wide area networks and nondedicated networks of workstations are characterized by frequent unavailability of the participating ma...
Mohan V. Nibhanupudi, Boleslaw K. Szymanski
RANDOM
1998
Springer
15 years 7 months ago
Using Approximation Hardness to Achieve Dependable Computation
Abstract. Redundancy has been utilized to achieve fault tolerant computation and to achieve reliable communication in networks of processors. These techniques can only be extended ...
Mike Burmester, Yvo Desmedt, Yongge Wang
IPPS
1998
IEEE
15 years 7 months ago
Experimental Study of Compiler Techniques for NUMA Machines
This study1 explores the applicability of fully automatic parallelizing techniques for parallel computers. In this study, we capitalize on a variety of traditional compiling techn...
Yunheung Paek, David A. Padua
EC
1998
112views ECommerce» more  EC 1998»
15 years 2 months ago
DNA Computation: Theory, Practice, and Prospects
L. M. Adleman launched the field of DNA computing with a demonstration in 1994 that strands of DNA could be used to solve the Hamiltonian path problem for a simple graph. He also...
Carlo C. Maley
SIAMCOMP
1998
96views more  SIAMCOMP 1998»
15 years 2 months ago
Fault-Tolerant Computation in the Full Information Model
We initiate an investigation of general fault-tolerant distributed computation in the full-information model. In the full information model no restrictions are made on the computat...
Oded Goldreich, Shafi Goldwasser, Nathan Linial