ResearchBib Share Your Research, Maximize Your Social Impacts
Sign for Notice Everyday Sign up >> Login

TRANSACT 2013 - 8th Workshop on Transactional Computing

Date2013-03-16 - 2013-03-20

Deadline2012-12-16

VenueHouston, USA - United States USA - United States

Keywords

Websitehttps://transact2013.cse.lehigh.edu/

Topics/Call fo Papers

The past decade has seen an explosion of interest in programming languages, systems, and hardware to support transactions, speculation, and related alternatives to classical lock-based concurrency. Recently, transactional memory has crossed two new thresholds. First, IBM and Intel have announced hardware support for transactional memory in upcoming processors. Second, the C++ Standard Committee has begun investigation into transactional memory as a new language feature. These developments highlight the demand for continued high quality TM research.
This workshop, the eighth in its series, will provide a forum for the presentation of research on all aspects of transactional computing. The scope of the workshop is intentionally broad, with the goal of encouraging interaction across the languages, architecture, systems, database, and theory communities. Papers may address implementation techniques, foundational results, applications and workloads, or experience with working systems. Environments of interest include the full range from multithreaded or multicore processors to high-end parallel computing. This year's workshop will place a special emphasis on transactional applications by featuring an application track with the award and possibly a prize given for the best application paper.
Topics
The workshop seeks papers on topics related to all areas of software and hardware for transactional computing. Specific topics of interest include but are not limited to:
General track:
Run-time systems
Hardware support
Memory models
Language mechanisms and semantics
Formal verification
Speculative concurrency
Conflict detection and contention management
Debugging and tools
Static analysis and compiler optimizations
Checkpointing and failure atomicity
Persistence and I/O
Nesting and exceptions
Application track:
Applications, workloads, and test suites
Experience reports
Papers should present original research. As transactional memory spans many disciplines, papers should provide sufficient background material to make them accessible to the broader community. Papers focused on foundations should indicate how the work can be used to advance practice; papers on experiences and applications should indicate how the experiments reinforce or reflect principles.
Submissions
Please use this link to access the submission website.
Papers must be submitted in PDF, and be no more than 8 pages in standard two-column SIGPLAN conference format including figures and tables but not including references. Shorter submissions are welcome. The submissions will be judged based on the merit of the ideas rather than the length. Submissions must be made through the on-line submission site. Final papers will be available to participants electronically at the meeting, but to facilitate resubmission to more formal venues, no archival proceedings will be published, and papers will not be sent to the ACM Digital Library.
Papers must identify whether they are intended for the General Track or Application Track. This should be addressed by including the text "(Application Track)" or "(General Track)" in the title of the paper.
Authors will have the option of having their final paper accessible from the workshop website. Authors must be familiar with and abide by SIGPLAN's republication policy, which forbids simultaneous submission to multiple venues and requires disclosing prior publication of closely related work.
At the discretion of the program committee and with the consent of the authors, particularly worthy papers may be recommended for a special journal issue.
Registration and Workshop Information
Please see the ASPLOS homepage for information about registration, hotels, local attractions, etc.

Last modified: 2012-12-08 22:33:22