(Enter summary)
Abstract: One approach to high-performance processing of massive
data sets is to incorporate computation into storage
systems. Previous work has shown that this active storage
model is effective for a variety of problems. This paper
explores opportunities to use active storage as a basis
for exploiting asymmetric parallelism in applications using
a streaming computation model on collections of fixed-size
records. This model is the basis for much of the research
in I/O-efficient algorithms, which deals... (Update)
Context of citations to this paper: More
.... In previous work, Wickremesinghe et al. introduced the notion of computation enabled storage nodes called Active Storage Units (ASU) [33]. Their architecture allows processing capacity to scale with storage space, and data movement to be reduced by running data searching,...
Cited by: More
An Active Storage Framework for Flexible Data.. - Anastasiadis..
(Correct)
Active bibliography (related documents): More All
0.6: The Sloan Digital Sky Survey and its Archive - Szalay, Kunszt, Thakar, al. (2000)
(Correct)
0.5: Type Systems for Distributed Data Structures - Ben Liblit Liblit (2000)
(Correct)
0.4: Dynamic Function Placement in Active Storage Clusters - Amiri, Petrou, Ganager, Gibson (1999)
(Correct)
Similar documents based on text: More All
0.5: Implementation and Evaluation of an Active Storage System.. - Ma, Reddy (2001)
(Correct)
0.4: Active Storage Hierarchy, Database Systems and Applications.. - Felipe Cario Jr (1999)
(Correct)
0.4: Efficient Sorting Using Registers and Caches - Arge, Chase, Vitter.. (2000)
(Correct)
BibTeX entry: (Update)
Wickremesinghe, R., Chase, J. S., and Vitter, J. S. Distributed Computing with Load-Managed Active Storage. In IEEE Intl Symp on High Performance Distributed Computing (Edinburgh, Scotland, July 2002), pp. 13--23. http://citeseer.ist.psu.edu/wickremesinghe02distributed.html More
@misc{ wickremesinghe02distributed,
author = "R. Wickremesinghe and J. Chase and J. Vitter",
title = "Distributed Computing with Load-Managed Active Storage",
text = "Wickremesinghe, R., Chase, J. S., and Vitter, J. S. Distributed Computing
with Load-Managed Active Storage. In IEEE Intl Symp on High Performance
Distributed Computing (Edinburgh, Scotland, July 2002), pp. 13--23.",
year = "2002",
url = "citeseer.ist.psu.edu/wickremesinghe02distributed.html" }
Citations (may not include all citations):
109
InputOutput complexity sorting and related problem (context) - Vitter, Output et al. - 1988
107
External-memory graph algorithms
- Chiang, Goodrich et al. - 1995 ACM DBLP
105
The Ninja architecture for robust Internetscale systems and ..
- Gribble - 1999
86
SEDA: An architecture for Well-Conditioned (context) - Welsh, Culler et al. - 2001
84
distributed data structures for Internet service constructio.. (context) - Gribble, Brewer et al. - 2000
75
Active storage for large-scale data mining and multimedia
- Riedel, Gibson et al. - 1998 ACM DBLP
74
high-bandwidth storage architecture (context) - Gibson, Nagle et al. - 1998
73
with River: Making the fast case common (context) - Arpaci-Dusseau, Anderson et al. - 1999
70
Active disks: Programming model (context) - Acharya, Uysal et al. - 1998
59
External memory algorithms and data structures: Dealing with..
- Vitter - 2001
51
Towards higher disk head utilization: Extracting
- Lumb, Schindler et al. - 2000
36
Designing and mining multi-terabyte astronomy archives: the ..
- Szalay, Kunszt et al. - 2000
31
Dynamic function placement for data-intensive cluster comput..
- Amiri, Petrou et al. - 2000
26
Freeblock scheduling outside of disk firmware
- Lumb, Schindler et al. - 2002 ACM DBLP
21
Highly concurrent shared storage
- Amiri, Gibson et al. - 2000 ACM DBLP
21
Active Disks -- Remote Execution for NetworkAttached Storage
- Riedel - 1999
21
Active disks - remote execution for network-attached storage
- Riedel, Gibson - 1997
15
Data mining on an OLTP system (context) - Riedel, Faloutsos et al. - 2000
14
Active disks for large-scale data processing
- Riedel, Faloutsos et al. - 2001 ACM DBLP
12
High-performance sorting on networks of workstations (context) - Arpaci-Dusseau, Arpaci-Dusseau et al. - 1997 ACM DBLP
10
Optimizing execution of component-based applications using g..
- Beynon, Kurc et al. - 2001 ACM
7
Timing-accurate storage emulation
- Griffin, Schindler et al. - 2002 ACM DBLP
5
Distribution sort with randomized cycling
- Vitter, Hutchinson - 2001
4
Performance Availability for Networks of Workstations (context) - Arpaci-Dusseau - 1999 ACM
4
Computer architecture support for database applications
- Keeton - 1999 ACM
4
with subsequent revisions (context) - Vengroff, manual - 1995
3
The architectural costs of streaming I/O: A comparison of wo.. (context) - Arpaci-Dusseau, Arpaci-Dusseau et al. - 1998
3
ACM Special Interest Group on Management of Data (context) - Keeton, Patterson et al. - 1998
3
Trees: A new parallel R-Tree architecture (context) - Schnitzer, Leutenegger - 1999
2
Searching for the sorting record: Experiences in tuning NOW-.. (context) - Arpaci-Dusseau, Arpaci-Dusseau et al. - 1998
1
Algorithms and Performance Evaluation of Active Disks (context) - Uysal - 1999
1
Flow computation on massive grids
- Toma, Wickremesinghe et al. - 2001 ACM DBLP
1
Disk-to--disk parallel sorting on HPVM clusters running Wind.. (context) - Rivera-Alvarez - 2000
1
Department of Electrical and Computer Engineering (context) - Amiri, manageable et al. - 2000
1
see Rivera's Thesis (context) - Zhang, Rivera et al.
1
Talk at Conference on File and Storage Technologies (context) - Gray - 2002
Documents on the same site (http://www.cs.duke.edu/~rajiv/papers/rajivown.html): More
The Link Database: Fast Access to Graphs of the Web - Randall, Stata.. (2001)
(Correct)
The Performance of in-Memory Sorting - Wickremesinghe (1999)
(Correct)
Efficient Sorting Using Registers and Caches - Arge, Chase, Vitter.. (2000)
(Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC