Sciweavers

5448 search results - page 340 / 1090
» Breakpoints and Time in Distributed Computations
Sort
View
FOCS
2000
IEEE
15 years 11 months ago
Extracting Randomness from Samplable Distributions
Randomness extractors convert weak sources of randomness into an almost uniform distribution; the conversion uses a small amount of pure randomness. In algorithmic applications, t...
Luca Trevisan, Salil P. Vadhan
ICDCS
2012
IEEE
13 years 9 months ago
Combining Partial Redundancy and Checkpointing for HPC
Today’s largest High Performance Computing (HPC) systems exceed one Petaflops (1015 floating point operations per second) and exascale systems are projected within seven years...
James Elliott, Kishor Kharbas, David Fiala, Frank ...
MOBIDE
1999
ACM
15 years 11 months ago
Pervasive Computing: What is it Good for?
The first mass-produced pervasive computing devices are starting to appear—the AutoPC, the Internet-connected ScreenFridge, and the combination Microwave Oven/Home Banking term...
Andrew C. Huang, Benjamin C. Ling, Shankar Ponneka...
DAGSTUHL
2007
15 years 8 months ago
Programming self developing blob machines for spatial computing.
: This is a position paper introducing blob computing: A Blob is a generic primitive used to structure a uniform computing substrate into an easier-to-program parallel virtual mach...
Frédéric Gruau, Christine Eisenbeis
SIGUCCS
2000
ACM
15 years 11 months ago
Where the Students Are...Computing Services at the Customer Source
Information and Access Technology Services at the University of Missouri-Columbia has long struggled with its physical location on the edge of campus. In my 20+ years of experienc...
Glenda E. Moum