Difference between revisions of "Event:PACT 2008"

From ConfIDent
(mobo import Concept___Events_With_Academic_Fields-migrated)
(mobo import Concept___Events-migrated)
Line 5: Line 5:
 
|Homepage=www.eecg.toronto.edu/pact
 
|Homepage=www.eecg.toronto.edu/pact
 
|City=Toronto
 
|City=Toronto
|Country=Canada
+
|Country=Country:CA
 
|Abstract deadline=Mar 20, 2008
 
|Abstract deadline=Mar 20, 2008
 
|Submission deadline=Mar 28, 2008
 
|Submission deadline=Mar 28, 2008
Line 16: Line 16:
 
|End Date=Oct 8, 2008
 
|End Date=Oct 8, 2008
 
|Academic Field=Computer Architecture
 
|Academic Field=Computer Architecture
 +
|Event Status=as scheduled
 +
|Event Mode=on site
 
}}
 
}}
  

Revision as of 14:45, 6 September 2022

The purpose of PACT is to bring together researchers from architecture, compilers, applications and languages to present and discuss innovative research of common interest. PACT  features cutting-edge research 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 architectures
    * Compiler/hardware support for hiding memory latencies
    * Support for correctness in hardware and software (esp. with concurrency)
    * Reconfigurable 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
    * High performance application specific systems
    * Applications and experimental systems studies
    * Non-traditional computing systems topics

Important Dates:

Abstracts due: Thursday, March 20th
Papers due: Friday, March 28th.
Reviews due: Monday, May 19th.
Rebuttal period: Wednesday, May 21st through Friday, May 23rd.
Notification: Monday June 9th.
Final version: July 28th.
	

This CfP was obtained from WikiCFP

Cookies help us deliver our services. By using our services, you agree to our use of cookies.