default search action
DISCS@SC 2014: New Orleans, Louisiana, USA
- Yong Chen, Philip C. Roth, Weikuan Yu, Dries Kimpe:
Proceedings of the 2014 International Workshop on Data Intensive Scalable Computing Systems, DISCS '14, New Orleans, Louisiana, USA, November 16-21, 2014. IEEE Computer Society 2014, ISBN 978-1-4799-7038-4
Programming models and frameworks
- Yi Liu, Xiongzi Ge, David Hung-Chang Du, Xiaoxia Huang:
Par-BF: a parallel partitioned Bloom filter for dynamic data sets. 1-8 - Rosa Filgueira, Iraklis A. Klampanos, Amrey Krause, Mário David, Alexander Moreno, Malcolm P. Atkinson:
dispel4py: a Python framework for data-intensive scientific computing. 9-16 - Jay F. Lofstead, Jai Dayal, Ivo Jimenez, Carlos Maltzahn:
Efficient, failure resilient transactions for parallel and distributed computing. 17-24
I/O and storage
- Teng Wang, Kevin Vasko, Zhuo Liu, Hui Chen, Weikuan Yu:
BPAR: a bundle-based parallel aggregation framework for decoupled I/O execution. 25-32 - Yanlong Yin, Antonios Kougkas, Kun Feng, Hassan Eslami, Yin Lu, Xian-He Sun, Rajeev Thakur, William Gropp:
Rethinking key-value store for parallel I/O optimization. 33-40 - Shuibing He, Yan Liu, Xian-He Sun:
PSA: a performance and space-aware data layout scheme for hybrid parallel file systems. 41-48
Algorithms and operations
- Eun-Sung Jung, Venkatram Vishwanath, Rajkumar Kettimuthu:
Distributed multipath routing algorithm for data center networks. 49-56 - Adnan Ozsoy:
CULZSS-bit: a bit-vector algorithm for lossless data compression on GPGPUs. 57-64 - Pietro Cicotti, Laura Carrington:
A caching approach to reduce communication in graph search algorithms. 65-72 - Marc Hartung, Michael Kluge:
Mapping of RAID controller performance data to the job history on large computing systems. 73-80
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.