Call for Papers

The 2014 International Workshop on
Data-Intensive Scalable Computing Systems (DISCS-2014)

Held in conjunction with SC14: The International Conference for High Performance Computing, Networking, Storage and Analysis.
Held in cooperation with ACM SIGHPC.

November 16, 2014
Ernest N. Morial Convention Center, New Orleans LA, USA

 

Call for Papers

Existing high performance computing (HPC) systems are designed primarily for workloads requiring high rates of computation.  However, the widening performance gap between processors and I/O systems, and trends toward higher data intensity in scientific and engineering applications, suggest there is a need to rethink HPC system architectures, programming models, runtime systems, and tools with a focus on data intensive computing.  The 2014 International Workshop on Data Intensive Scalable Computing Systems (DISCS) provides a forum for researchers interested in HPC and data intensive computing to exchange ideas and discuss approaches for addressing Big Data challenges.

Topics of Interest

The topics of interest for the DISCS-2014 workshop include, but are not limited to:

  • HPC system architectures for data intensive applications
    • Data-centric system architectures
    • I/O systems and architectures
    • System area networks
    • Power efficient systems
  • Programming models supporting data intensive applications
    • Data-centric programming models
    • MPI extensions for data intensive applications
    • GAS/PGAS programming model extensions for data intensive applications
    • Non-traditional programming languages/methodologies
  • Runtime systems supporting data intensive applications
    • Communication systems for supporting data intensive applications
    • Data compression and de-duplication
    • Caching and prefetching
    • Reliability and fault tolerance
    • Data integrity and consistency
  • Productivity tools supporting data intensive applications
    • Data analytic tools
    • Tracing and trace analysis tools
    • Data mining and knowledge discovery tools
    • Computational, mathematical and statistical techniques and tools supporting such techniques
    • Data visualization techniques and tools supporting such techniques

Keynote

Dr. Daniel A. Reed will deliver the keynote address for DISCS-2014.  Dr. Reed is the Vice President for Research and Economic Development at the University of Iowa, as well as the University Computational Science and Bioinformatics Chair and Professor of Computer Science and Electrical and Computer Engineering.  Dr. Reed has extensive research experience in the areas of high performance computing and data intensive computing, and has served academia, industry, and government organizations as an advisor on technology policy.

Important Dates

  • Submission deadline: August 8, 2014 August 22, 2014
  • Author notification: September 19, 2014
  • Camera-ready version due for proceedings: October 10, 2014
  • Workshop date: November 16, 2014

Submission Instructions

Submissions should be unpublished work and in PDF format on US Letter sized paper (8.5”x11”) with not more than 8 pages (all inclusive) formatted according to the IEEE double-column format for Conference Proceedings (IEEEtran template). All accepted papers will appear in the workshop proceedings in the ACM Digital Library and IEEE Xplore. See the DISCS-2014 submissions page for details.

Journal Special Issue

DISCS-2014 workshop papers with relevance with an application will be invited to extend the manuscripts to be considered for a journal Special Issue on Data-Intensive High Performance Computing of the International Journal of High Performance Computing Applications (IJHPCA). We will announce details later.

Questions?

Send questions to the DISCS-2014 workshop organizers by email to discs2014@easychair.org.  See the DISCS-2014 web site for the most up-to-date information.

PDF

The DISCS-2014 call for papers is also available in PDF form.  Feel free to share electronically with your colleagues or to print and post it where colleagues will see it.