JiscMail Logo
Email discussion lists for the UK Education and Research communities

Help for CPHC-CONF Archives


CPHC-CONF Archives

CPHC-CONF Archives


cphc-conf@JISCMAIL.AC.UK


View:

Message:

[

First

|

Previous

|

Next

|

Last

]

By Topic:

[

First

|

Previous

|

Next

|

Last

]

By Author:

[

First

|

Previous

|

Next

|

Last

]

Font:

Proportional Font

LISTSERV Archives

LISTSERV Archives

CPHC-CONF Home

CPHC-CONF Home

CPHC-CONF  August 2016

CPHC-CONF August 2016

Options

Subscribe or Unsubscribe

Subscribe or Unsubscribe

Log In

Log In

Get Password

Get Password

Subject:

[CFP] IA^3 2016 - DEADLINE EXTENDED TO SEPTEMBER 7

From:

"Tumeo, Antonino" <[log in to unmask]>

Reply-To:

Tumeo, Antonino

Date:

Wed, 24 Aug 2016 01:31:47 +0000

Content-Type:

text/plain

Parts/Attachments:

Parts/Attachments

text/plain (1 lines)

[Apologies if you receive multiple copies of this CFP]



IA^3 2016 - Sixth Workshop on Irregular Applications: Architectures and Algorithms

http://hpc.pnl.gov/IA3

November 13 2016

Salt Lake City, UT



To be held in conjunction with SC16

To be held in cooperation with SIGHPC



———————————————————————————————————

Call for Papers

———————————————————————————————————



Irregular applications occur in many subject matters. While inherently parallel, they exhibit highly variable execution performance at a local level due to unpredictable memory access patterns and/or network transfers, divergent control structures, and data imbalances. Moreover, they often require fine-grain synchronization and communication on large-data structures such as graphs, trees, unstructured grids, tables, sparse matrices, deep nets, and their combinations (such as, for example, attributed graphs). They have a significant degree of latent parallelism, which however is difficult to exploit due to their complex behavior. Current high performance architectures rely on data locality and regular computation to reduce access latencies, and often do not cope well with the requirements of these applications. Furthermore, irregular applications are difficult to scale on current supercomputing machines, due to their limits in fine-grained synchronization and small data transfers.



Irregular applications pertain both to well established and emerging fields, such as machine learning, social network analysis, bioinformatics, semantic graph databases, Computer Aided Design (CAD), and computer security.  Many of these application areas also process massive sets of unstructured data, which keep growing exponentially. Addressing the issues of irregular applications on current and future architectures will become critical to solve the challenges in science and data analysis of the next few years.



This workshop seeks to explore solutions for supporting efficient execution of irregular applications in the form of new features at the level of the micro- and system-architecture, network, languages and libraries, runtimes, compilers, analysis, algorithms. Topics of interest, of both theoretical and practical significance, include but are not limited to:



* Micro- and System-architectures, including multi- and many-core designs, heterogeneous processors, accelerators (GPUs, vector processors, Automata processor), reconfigurable (coarse grained reconfigurable and FPGA designs) and custom processors 

* Network architectures and interconnect (including high-radix networks, optical interconnects) 

* Novel memory architectures and designs (including processors-in memory) 

* Impact of new computing paradigms on irregular workloads (including neuromorphic processors and quantum computing) 

* Modeling, simulation and evaluation of novel architectures with irregular workloads 

* Innovative algorithmic techniques 

* Combinatorial algorithms (graph algorithms, sparse linear algebra, etc.)

* Impact of irregularity on machine learning approaches

* Parallelization techniques and data structures for irregular workloads

* Data structures combining regular and irregular computations (e.g., attributed graphs)

* Approaches for managing massive unstructured datasets (including streaming data) 

* Languages and programming models for irregular workloads

* Library and runtime support for irregular workloads

* Compiler and analysis techniques for irregular workloads

* High performance data analytics applications, including graph databases 



Besides regular papers, papers describing work-in-progress or incomplete but sound, innovative ideas related to the workshop theme are also encouraged. We solicit both 8-page regular papers and 4-page position papers. Authors of exciting but not mature enough regular papers may be offered the option of a short 4-page paper and related short presentation.



———————————————————————————————————

Special Issue

———————————————————————————————————

Authors of papers accepted at the workshop will be invited to submit extended and updated versions of their work for a Special Issue of Elsevier’s Journal of Parallel and Distributed Computing (JPDC) on Systems for Learning, Inferencing, and Discovering (SLID).

http://www.journals.elsevier.com/journal-of-parallel-and-distributed-computing/call-for-papers/special-issue-on-systems-for-learning-inferencing-and-discov



———————————————————————————————————

Important Dates - EXTENDED

———————————————————————————————————

Abstract submission:                                7 September 2016 23:59 PST - EXTENDED

Position or full paper submission:             7 September 2016 23:59 PST - EXTENDED

Notification of acceptance:                        3 October 2016

Camera-ready position and full papers:    10 October 2016

Workshop:                                                 13 November 2016

———————————————————————————————————

Submissions

———————————————————————————————————

Submission site: https://easychair.org/conferences/?conf=ia32016



All submissions should be in double-column, single-spaced letter format, using 10-point size fonts, with at least one-inch margins on each side and respect the IEEE conference templates available at: http://www.ieee.org/conferences_events/conferences/publishing/templates.html. 



The proceedings of the workshop will be published in cooperation with ACM SIGHPC. 



Submitted manuscripts may not exceed eight (8) pages in length for regular papers and four (4) pages for position papers including figures, tables and references.



For any question, please contact the organizers at [log in to unmask], [log in to unmask], and [log in to unmask]



———————————————————————————————————

Organization

———————————————————————————————————

Organizers



Antonino Tumeo, PNNL, [log in to unmask]

John Feo, PNNL, Northwest Institute for Advanced Computing (NIAC), [log in to unmask]

Oreste Villa, NVIDIA Research, [log in to unmask]



Program Committee 



Scott Beamer, Lawrence Berkeley National Laboratory, US

Michela Becchi, University of Missouri, US

David Brooks, Harvard University, US

Hubertus Franke, IBM TJ Watson, US

John Gilbert, University of California at Santa Barbara, US

Maya Gokhale, Lawrence Livermore National Laboratory, US

Vivek Kumar, Rice University, US

John Leidel, Texas Tech University, US

Kamesh Madduri, Penn State University, US

Naoya Maruyama, RIKEN AICS, JP

Satoshi Matsuoka, Tokio Institute of Technology, JP

Tim Mattson, Intel, US

Richard Murphy, Micron, US

Miquel Moretó, UPC-BSC, ES

Walid Najjar, University of California Riverside, US

Jacob Nelson, University of Washington, US

Ozcan Ozturk, Bilkent University, TR

Gianluca Palermo, Politecnico di Milano, IT

D.K. Panda, The Ohio State University, US

Fabrizio Petrini, Intel, US

Jason Riedy, Georgia Institute of Technology, US

Daniel Sanchez, Massachusetts Institute of Technology, US

Erik Saule, University of North Carolina at Charlotte, US

John Shalf, Lawrence Berkeley National Laboratory, US

Ruud Van Der Pas, Oracle, US

Flavio Vella, Sapienza, University of Rome, IT

Top of Message | Previous Page | Permalink

JiscMail Tools


RSS Feeds and Sharing


Advanced Options


Archives

November 2019
October 2019
September 2019
August 2019
July 2019
June 2019
May 2019
April 2019
March 2019
February 2019
January 2019
December 2018
November 2018
October 2018
September 2018
August 2018
July 2018
June 2018
May 2018
April 2018
March 2018
February 2018
January 2018
December 2017
November 2017
October 2017
September 2017
August 2017
July 2017
June 2017
May 2017
April 2017
March 2017
February 2017
January 2017
December 2016
November 2016
October 2016
September 2016
August 2016
July 2016
June 2016
May 2016
April 2016
March 2016
February 2016
January 2016
December 2015
November 2015
October 2015
September 2015
August 2015
July 2015
June 2015
May 2015
April 2015
March 2015
February 2015
January 2015
December 2014
November 2014
October 2014
September 2014
August 2014
July 2014
June 2014
May 2014
April 2014
March 2014
February 2014
January 2014
December 2013
November 2013
October 2013
September 2013
August 2013
July 2013
June 2013
May 2013
April 2013
March 2013
February 2013
January 2013
December 2012
November 2012
October 2012
September 2012
August 2012
July 2012
June 2012
May 2012
April 2012
March 2012
February 2012
January 2012
December 2011
November 2011
October 2011
September 2011
August 2011
July 2011
June 2011
May 2011
April 2011
March 2011
February 2011
January 2011
December 2010
November 2010
October 2010
September 2010
August 2010
July 2010
June 2010
May 2010
April 2010
March 2010
February 2010
January 2010
December 2009
November 2009
October 2009
September 2009
August 2009
July 2009
June 2009
May 2009
April 2009
March 2009
February 2009
January 2009
December 2008
November 2008
October 2008
September 2008
August 2008
July 2008
June 2008
May 2008
April 2008
March 2008
February 2008
January 2008
December 2007
November 2007
October 2007
September 2007
August 2007
July 2007
June 2007
May 2007
April 2007
March 2007
February 2007
January 2007
2006
2005
2004
2003
2002
2001
2000
1999
1998


JiscMail is a Jisc service.

View our service policies at https://www.jiscmail.ac.uk/policyandsecurity/ and Jisc's privacy policy at https://www.jisc.ac.uk/website/privacy-notice

Secured by F-Secure Anti-Virus CataList Email List Search Powered by the LISTSERV Email List Manager