Date(s) - 11/09/2016 - 15/09/2016
9:00 am - 5:00 pm
Dan Carmel Hotel
Categories No Categories
Visit the PACT2016 website for more inforamtion (click here)
PACT has started as a Data Flow Workshop in conjunction with ISCA 1989 but has quickly evolved into a unique venue at the intersection of "classical" parallel architecture and compilers. Looking forward, to the evolving field, we would like to widen the scope of this 25th anniversary edition of PACT to include modern aspects of related technologies such as, but not limited to, machine learning, data analytics and computational biology that are important for the design of future parallel architectures and compilers.
PACT solicits novel papers, workshops, tutorials and entries to an ACM student research competition on a broad range of topics that include, but are not limited to:
- Parallel architectures and computational models
- Compilers and tools for parallel computer systems
- Multicore, multithreaded, superscalar and VLIW architecutres
- Compliler/hardware supprt for dealing with memory latencies
- Support for correctness in concurrent hardware and software
- Reconfigurable parallel computing
- Dynamic translation and optimization
- I/O issues in parallel computing and their relation to applications
- Parallel programming languages, algorithms and applications
- Middleware and run time system support for parallel computing
- Application-specific parallel systems
- Applications and experimental systems studies of parallel processing
- Relevant aspects of distributed computing and mobile computing
- Heterogeneous systems using various types of accelerators
- Insights from modern parallel applications such as, but not limited to, machine learning, data analytics, computational biology, etc., that can influence the design of future parallel architectures and compilers
PACT 2016 submissions will be judged on originality, significance, interest, clarity, and correctness. A submission consists of an abstract and a paper formatted according to the instructions provided below.
- Abstract Deadline: March 12, 2016
- Paper Deadline: March 18, 2016
- Rebuttal after Phase I: May 7-10, 2016
- Rebuttal after Phase II: June 15-18, 2016
- Author Notification: June 30, 2016
- Camera Ready Final Papers: July 30, 2016
Abstract and Paper Submission
Abstract and paper submission guidelines can be found on the Paper Submission Information page. Please review these instructions carefully before making your submission.
The 25th International Conference on Parallel Architectures and Compilation Techniques (PACT) is seeking proposals for workshops and tutorials to accompany the conference. We encourage members of the community to consider submitting proposals for workshops and tutorials that bring together researchers and practitioners working on research topics of interest to the PACT community.
- Proposal Deadline: Fri, April 8 2016 (23:59 PST)
- Acceptance Notification: Fri, April 22 2016 (23:59 PST)
All proposals should be no longer than one page, in PDF format and must provide the following information:
- Workshop or tutorial name along with a brief 150 to 200-word abstract describing the event suitable for the conference web site.
- If applicable, provide a description of past versions of the activity, including dates, organizers, submission and acceptance counts, attendance, and information with which conference the workshop/tutorial was co-located.
- Brief rationale for the event and for co-locating with PACT.
- Names and affiliations of main organizers and, where relevant, tentative composition of the committees (as complete as possible).
- Event format, i.e., length of event (half-day or full-day), expected number of presented papers, invited talks, panels, demonstrations, number of days, etc.
- Expected number of submissions and participants.
- For workshops: A draft Call For Papers (CFP), as complete as possible and submission/reviewing deadlines (internal and external).
Proposals should be emailed to both:
Yoav Etsion, Technion, Israel
Christian Fensch, Heriot-Watt University, United Kingdom