|
|
| Line 1: |
Line 1: |
| | {{Event | | {{Event |
| − | |Acronym=CGO 2009 | + | |Acronym=SIGGRAPH 1981 |
| − | |Title=7th Annual IEEE/ ACM International Symposium on Code Generation and Optimization | + | |Title=International Conference on Computer Graphics and Interactive Techniques |
| − | |Type=Conference
| + | |Ordinal=8 |
| − | |Homepage=www.cgo.org
| + | |In Event Series=Event Series:SIGGRAPH |
| − | |City=Seattle
| |
| − | |State=WA | |
| − | |Country=Country:US | |
| − | |wikicfpId=3516
| |
| − | |pageCreator=127.0.0.1
| |
| − | |contributionType=1
| |
| | |Single Day Event=no | | |Single Day Event=no |
| − | |Start Date=Mar 22, 2009 | + | |Start Date=1981/08/03 |
| − | |End Date=Mar 25, 2009 | + | |End Date=1981/08/07 |
| − | |Academic Field=Programming Languages
| |
| | |Event Status=as scheduled | | |Event Status=as scheduled |
| | |Event Mode=on site | | |Event Mode=on site |
| − | }}
| + | |City=Dallas |
| − | {{Event Deadline
| + | |Region=Texas |
| − | |Abstract Deadline=Sep 12, 2008 | + | |Country=Country:US |
| − | |Submission Deadline=Sep 19, 2008 | + | |Academic Field=Computer Graphics |
| | + | |Type=Conference |
| | + | |Homepage=siggraph.org |
| | + | |Submitted papers=132 |
| | + | |Accepted papers=38 |
| | + | |pageCreator=User:Curator 89 |
| | + | |pageEditor=User:Curator 89 |
| | + | |contributionType=1 |
| | }} | | }} |
| | {{Event Deadline}} | | {{Event Deadline}} |
| | {{S Event}} | | {{S Event}} |
| − |
| |
| − | <pre>
| |
| − | CGO-2009 Call For Papers
| |
| − |
| |
| − | March 22-25, 2009 at Seattle, Washington
| |
| − |
| |
| − | Sponsored by IEEE Computer Society TC-uARCH and ACM SIGMICRO in cooperation with ACM SIGPLAN
| |
| − |
| |
| − | The International Symposium on Code Generation and Optimization (CGO) provides a premier venue to bring together researchers and practitioners working on feedback-directed optimization and back-end compilation techniques. The conference covers optimization for parallelism, performance, power, and security, where that optimization occurs in the mapping from an input (including APIs, high-level languages, byte codes such as .NET or Java, or ISAs) to a similar or lower-level target machine representation.
| |
| − |
| |
| − | Papers are solicited in areas that support such mapping and optimization:
| |
| − |
| |
| − | * Compilers, back-end code generators, translators, binary optimization tools and runtime environments; static, dynamic, adaptive, or continuous techniques
| |
| − | * Innovative analysis, transformation, and optimization techniques
| |
| − | * Memory management, including data distribution, synchronization and GC
| |
| − | * Thread extraction and thread-level speculation, especially for multi-core systems
| |
| − | * Vertical integration of language features, representations, optimizations, and runtime support for parallelism (including support for transactional semantics, efficient message passing, and dynamic thread creation)
| |
| − | * Phase detection and analysis techniques
| |
| − | * Mechanisms and optimization techniques supporting the efficient implementation of security protection models, reliability and energy efficiency
| |
| − | * Traditional compiler optimizations
| |
| − | * Intermediate representations that enable more powerful or efficient optimization
| |
| − | * Hardware mechanisms and systems that implement or assist in any of the above
| |
| − | * Experiences with real dynamic optimization and compilation systems, particularly with large, complex applications
| |
| − | * Explorations of trade-offs concerning when (static/dynamic) and where (software/hardware) to optimize
| |
| − | * Particularly novel ideas of interest to this community
| |
| − |
| |
| − | IMPORTANT DATES: Abstract deadline is September 12, 2008. Paper deadline is September 19, 2008. There will be NO EXTENSIONS. Contact Manish Vachharajani (manishv at colorado.edu) to submit a Workshop or Tutorial proposal by November 18, 2008.
| |
| − | </pre>This CfP was obtained from [http://www.wikicfp.com/cfp/servlet/event.showcfp?eventid=3516&copyownerid=2 WikiCFP]
| |
