The input/output complexity of sorting and related problems
Communications of the ACM
High-performance sorting on networks of workstations
SIGMOD '97 Proceedings of the 1997 ACM SIGMOD international conference on Management of data
Searching for the sorting record: experiences in tuning NOW-Sort
SPDT '98 Proceedings of the SIGMETRICS symposium on Parallel and distributed tools
A case for intelligent disks (IDISKs)
ACM SIGMOD Record
Active disks: programming model, algorithms and evaluation
Proceedings of the eighth international conference on Architectural support for programming languages and operating systems
A cost-effective, high-bandwidth storage architecture
Proceedings of the eighth international conference on Architectural support for programming languages and operating systems
Cluster I/O with River: making the fast case common
Proceedings of the sixth workshop on I/O in parallel and distributed systems
External-memory graph algorithms
Proceedings of the sixth annual ACM-SIAM symposium on Discrete algorithms
Data mining on an OLTP system (nearly) for free
SIGMOD '00 Proceedings of the 2000 ACM SIGMOD international conference on Management of data
Designing and mining multi-terabyte astronomy archives: the Sloan Digital Sky Survey
SIGMOD '00 Proceedings of the 2000 ACM SIGMOD international conference on Management of data
Distribution sort with randomized cycle
SODA '01 Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms
The Ninja architecture for robust Internet-scale systems and services373423
Computer Networks: The International Journal of Computer and Telecommunications Networking - pervasive computing
External memory algorithms and data structures: dealing with massive data
ACM Computing Surveys (CSUR)
SEDA: an architecture for well-conditioned, scalable internet services
SOSP '01 Proceedings of the eighteenth ACM symposium on Operating systems principles
Flow computation on massive grids
Proceedings of the 9th ACM international symposium on Advances in geographic information systems
Freeblock Scheduling Outside of Disk Firmware
FAST '02 Proceedings of the Conference on File and Storage Technologies
Active Storage for Large-Scale Data Mining and Multimedia
VLDB '98 Proceedings of the 24rd International Conference on Very Large Data Bases
Timing-Accurate Storage Emulation
FAST '02 Proceedings of the Conference on File and Storage Technologies
Optimizing Execution of Component-based Applications using Group Instances
CCGRID '01 Proceedings of the 1st International Symposium on Cluster Computing and the Grid
The Architectural Costs of Streaming I/O: A Comparison of Workstations, Clusters, and SMPs
HPCA '98 Proceedings of the 4th International Symposium on High-Performance Computer Architecture
Master-Client R-Trees: A New Parallel R-Tree Architecture
SSDBM '99 Proceedings of the 11th International Conference on Scientific and Statistical Database Management
Highly Concurrent Shared Storage
ICDCS '00 Proceedings of the The 20th International Conference on Distributed Computing Systems ( ICDCS 2000)
Active disks: remote execution for network-attached storage
Active disks: remote execution for network-attached storage
Programming model, algorithms and performance evaluation of active disks
Programming model, algorithms and performance evaluation of active disks
Performance availability for networks of workstations
Performance availability for networks of workstations
Computer architecture support for database applications
Computer architecture support for database applications
Scalable and manageable storage systems
Scalable and manageable storage systems
Towards higher disk head utilization: extracting free bandwidth from busy disk drives
OSDI'00 Proceedings of the 4th conference on Symposium on Operating System Design & Implementation - Volume 4
Scalable, distributed data structures for internet service construction
OSDI'00 Proceedings of the 4th conference on Symposium on Operating System Design & Implementation - Volume 4
Dynamic function placement for data-intensive cluster computing
ATEC '00 Proceedings of the annual conference on USENIX Annual Technical Conference
Diamond: A Storage Architecture for Early Discard in Interactive Search
FAST '04 Proceedings of the 3rd USENIX Conference on File and Storage Technologies
Improving Data Access for Computational Grid Applications
Cluster Computing
DataLab: transactional data-parallel computing on an active storage cloud
HPDC '08 Proceedings of the 17th international symposium on High performance distributed computing
Abstract storage: moving file format-specific abstractions intopetabyte-scale storage systems
Proceedings of the second international workshop on Data-aware distributed computing
Diamond: a storage architecture for early discard in interactive search
FAST'04 Proceedings of the 3rd USENIX conference on File and storage technologies
Self-star Properties in Complex Information Systems
Insights for exascale IO APIs from building a petascale IO API
SC '13 Proceedings of the International Conference on High Performance Computing, Networking, Storage and Analysis
| Hi-index | 0.00 |
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 with an important class of massive data problems not studied in previous work on active storage.We present an extension of a streaming computation model for an external memory toolkit to support a flexible mapping of computations to storage-based processors. Our approach enables load-managed active storage: it exposes parallelism, ordering constraints, and primitive computation units to the system, which can configure the application to balance load and make the best use of available processing power. Emulation results from a sorting application demonstrate the potential of dynamic adaptation in load-managed active storage.