Sciweavers

1993 search results - page 161 / 399
» Designing and Building Parallel Program
Sort
View
MST
1998
91views more  MST 1998»
13 years 7 months ago
An Experimental Analysis of Parallel
We have developed a methodology for predicting the performance of parallel algorithms on real parallel machines. The methodology consists of two steps. First, we characterize a mac...
Guy E. Blelloch, Charles E. Leiserson
PVLDB
2008
182views more  PVLDB 2008»
13 years 7 months ago
SCOPE: easy and efficient parallel processing of massive data sets
Companies providing cloud-scale services have an increasing need to store and analyze massive data sets such as search logs and click streams. For cost and performance reasons, pr...
Ronnie Chaiken, Bob Jenkins, Per-Åke Larson,...
HCW
2000
IEEE
14 years 16 days ago
Design of a Framework for Data-Intensive Wide-Area Applications
Applications that use collections of very large, distributed datasets have become an increasingly important part of science and engineering. With high performance wide-area networ...
Michael D. Beynon, Tahsin M. Kurç, Alan Sus...
BMCBI
2008
108views more  BMCBI 2008»
13 years 8 months ago
SPRINT: A new parallel framework for R
Background: Microarray analysis allows the simultaneous measurement of thousands to millions of genes or sequences across tens to thousands of different samples. The analysis of t...
Jon Hill, Matthew Hambley, Thorsten Forster, Murie...
ICFP
2005
ACM
14 years 8 months ago
Monadic augment and generalised short cut fusion
Monads are commonplace programming devices that are used to uniformly structure computations with effects such as state, exceptions, and I/O. This paper further develops the monad...
Neil Ghani, Patricia Johann, Tarmo Uustalu, Varmo ...