default search action
DISCS@SC 2013: Denver, Colorado, USA
- Xian-He Sun, Yong Chen, Philip C. Roth:
Proceedings of the 2013 International Workshop on Data-Intensive Scalable Computing Systems, DISCS 2013, Denver, Colorado, USA, November 18, 2013. ACM 2013, ISBN 978-1-4503-2506-6
Data intensive architectures and runtime systems
- Jiangling Yin, Junyao Zhang, Jun Wang, Wu-chun Feng:
SDAFT: a novel scalable data access framework for parallel BLAST. 1-6 - Shivaswamy Rohit, Abani K. Patra, Vipin Chaudhary:
Large data and computation in a hazard map workflow using Hadoop and Neteeza architectures. 7-12 - Michael Sevilla, Ike Nassi, Kleoni Ioannidou, Scott A. Brandt, Carlos Maltzahn:
A framework for an in-depth comparison of scale-up and scale-out. 13-18 - Dominique LaSalle, George Karypis:
BDMPI: conquering BigData with small clusters using MPI. 19-24
Data-intensive programming models and file systems
- Joong-Yeon Cho, Hyun-Wook Jin, Min Lee, Karsten Schwan:
On the core affinity and file upload performance of Hadoop. 25-30 - Yong Li, Dan Feng, Zhan Shi:
Enhancing both fairness and performance using rate-aware dynamic storage cache partitioning. 31-36 - Patrick Donnelly, Douglas Thain:
Design of an active storage cluster file system for DAG workflows. 37-42
Data analytics and tools
- Peter Coetzee, Stephen A. Jarvis:
CRUCIBLE: towards unified secure on- and off-line analytics at scale. 43-48 - Lan Vu, Gita Alaghband:
Novel parallel method for mining frequent patterns on multi-core shared memory systems. 49-54 - Alan R. Chappell, Sutanay Choudhury, John Feo, David J. Haglin, Alessandro Morari, Sumit Purohit, Karen Schuchardt, Antonino Tumeo, Jesse Weaver, Oreste Villa:
Toward a data scalable solution for facilitating discovery of scientific data resources. 55-60
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.