Voici une revue scientifique qui pourrait être une cible intéressante pour nos travaux.

Marc

Begin forwarded message:

From: Tom Conte tom@conte.us Subject: [Hipeac-publicity] Call for contributions to ACM TACO 2.0 Date: 27 January, 2013 2:31:23 PM EST To: announcements@lists.artist-embedded.org, publicity@hipeac.net, hpc-announce@mcs.anl.gov, micro_publicity@crhc.uiuc.edu, cgo_publicity@freelists.or, socinfo@cs.tut.fi, performance@merlot.usc.edu, TCPP-announce@lists.ece.unm.edu, ancs-announce@mail.cse.wustl.edu, sigplan-l@acm.uiuc.edu, sdmas@googlegroups.com, SIGOPS-ANNOUNCE@listserv.acm.org, distributed-computing-announce@datasys.cs.iit.edu, prozessoren@listserv.uni-augsburg.de, tcsc@cse.stfx.ca, sbac-l@sbc.org.br, wireless-info@lists.chambana.net, asr-forum@cines.fr, ahsntc-mailing-list@list.trlab.ca, announce@hipeac.net, sigarch-members@listserv.acm.org Cc: Per Stenström per.stenstrom@chalmers.se, Koen De Bosschere Koen.DeBosschere@elis.ugent.be

Do you know ACM TACO 2.0?

Over the last two years ACM TACO has optimized its internal processes. Today, the average turnaround time from submission to first response is 55 days which is less than two months. For revised manuscripts, the review process goes even faster. In 2012, most accepted manuscripts went through two rounds of reviews to reach a final decision only 5 months after submission. Accepted manuscripts are printed in the next ACM TACO issue – which means an extra delay of at most 3 months. Hence, excellent manuscripts can make it from submission to print in 6 months; papers needing a major revision will make it to print in at most 9 months. The ACM TACO acceptance rate after two review rounds was 24% in 2011; it is 26% in 2012. We call this “ACM TACO 2.0.”

ACM TACO 2.0 now has a review cycle and an acceptance rate which is competitive with the best ACM conferences, but without the inconvenient non-negotiable submission deadlines, and with the advantage of being able to revise a paper based on the detailed review reports by carefully selected reviewers, and of being published as soon as it is accepted. On top of that, authors of original work papers get an open invitation to present their paper at the yearly HiPEAC conference, which is the premier European network event on topics central to ACM TACO, attended by more than 500 scientists.

For the 2013 ACM TACO 2.0 issues, we are calling for high-quality manuscripts on topics included, but not limited to: · Computer system architectures and processor architectures, including multiprocessors and multithreaded computers · Interaction of operating systems, compilers, programming languages, and architecture · Feedback-Directed Software/Hardware Optimization · Dynamic compilation, adaptive execution, and continuous profiling/optimization. · Virtual machine, binary translation hardware, and software optimizations · Compiler optimizations that exploit instruction level parallelism, such as software pipelining, global scheduling, register allocation, and memory disambiguation · Advanced software and hardware speculation, prediction, and predication techniques. · High-performance microarchitecture innovation (e.g., VLIW, superscalar, multithreaded, etc.) · Architectures and compilers for embedded processors, application specific processors and DSPs, including network and router architectures · Memory system optimization · Parallel processing · Architecture or compiler-based power and energy optimization · Application characterization and architectural implications · Performance evaluation and measurement of real systems · Papers of interest to the SIGMICRO, SIGARCH, and SIGPLAN community There is no deadline but manuscripts are processed on a first-come-first-served basis. Submit your best work via http://mc.manuscriptcentral.com/taco as soon as it is ready to go. We will work hard to get back to you in 2 months with your reviews.

Prof. Tom Conte ACM TACO Editor-in-Chief

Prof. Per Stenström Prof. Koen De Bosschere ACM TACO Senior Associate Editors

Content of the last ACM TACO issue

Feedback-driven binary code diversification to the special issue on high-performance embedded architectures and compilers, by Bart Coppens, Bjorn De Sutter, Jonas Maebe http://dl.acm.org/citation.cfm?id=2400683

A performance and energy comparison of convolution on GPUs, FPGAs, and multicore processors, by Jeremy Fowers, Greg Brown, John Wernsing, Greg Stitt http://dl.acm.org/citation.cfm?id=2400684

Vectorization technology to improve interpreter performance, by Erven Rohou, Kevin Williams, David Yuste http://dl.acm.org/citation.cfm?id=2400685

Fast asymmetric thread synchronization, by Jimmy Cleary, Owen Callanan, Mark Purcell, David Gregg http://dl.acm.org/citation.cfm?id=2400686

PS-TLB: Leveraging page classification information for fast, scalable and efficient translation for future CMPs, by Yong Li, Rami Melhem, Alex K. Jones http://dl.acm.org/citation.cfm?id=2400687

Per-thread cycle accounting in multicore processors, by Kristof Du Bois, Stijn Eyerman, Lieven Eeckhout http://dl.acm.org/citation.cfm?id=2400688

Maxine: An approachable virtual machine for, and in, java, by Christian Wimmer, Michael Haupt, Michael L. Van De Vanter, Mick Jordan, Laurent Daynès, Douglas Simon http://dl.acm.org/citation.cfm?id=2400689

A script-based autotuning compiler system to generate high-performance CUDA code, by Malik Khan, Protonu Basu, Gabe Rudy, Mary Hall, Chun Chen, Jacqueline Chame http://dl.acm.org/citation.cfm?id=2400690

Understanding fundamental design choices in single-ISA heterogeneous multicore architectures, by Kenzo Van Craeynest, Lieven Eeckhout http://dl.acm.org/citation.cfm?id=2400691

The CRNS framework and its application to programmable and reconfigurable cryptography, by Samuel Antão, Leonel Sousa http://dl.acm.org/citation.cfm?id=2400692

A decoupled local memory allocator, by Boubacar Diouf, Can Hantaş, Albert Cohen, Özcan Özturk, Jens Palsberg http://dl.acm.org/citation.cfm?id=2400693

Layout-oblivious compiler optimization for matrix computations, by Huimin Cui, Qing Yi, Jingling Xue, Xiaobing Feng http://dl.acm.org/citation.cfm?id=2400694

Compiler support for lightweight context switching, by Stephen Dolan, Servesh Muralidharan, David Gregg http://dl.acm.org/citation.cfm?id=2400695

LIGERO: A light but efficient router conceived for cache-coherent chip multiprocessors, by Pablo Abad, Valentin Puente, Jose-Angel Gregorio http://dl.acm.org/citation.cfm?id=2400696

Exploiting reuse locality on inclusive shared last-level caches, by Jorge Albericio, Pablo Ibáñez, Víctor Viñals, Jose María Llabería http://dl.acm.org/citation.cfm?id=2400697

Optimizing software runtime systems for speculative parallelization, by Paraskevas Yiapanis, Demian Rosas-Ham, Gavin Brown, Mikel Luján http://dl.acm.org/citation.cfm?id=2400698

Algorithmic species: A classification of affine loop nests for parallel programming, by Cedric Nugteren, Pieter Custers, Henk Corporaal http://dl.acm.org/citation.cfm?id=2400699

Optimal DPM and DVFS for frame-based real-time systems, by Marco E. T. Gerards, Jan Kuper http://dl.acm.org/citation.cfm?id=2400700

An integrated pseudo-associativity and relaxed-order approach to hardware transactional memory, by Zhichao Yan, Hong Jiang, Yujuan Tan, Dan Feng http://dl.acm.org/citation.cfm?id=2400701

Profile-guided floating- to fixed-point conversion for hybrid FPGA-processor applications, by Doris Chen, Deshanand Singh http://dl.acm.org/citation.cfm?id=2400702

Lock-contention-aware scheduler: A scalable and energy-efficient method for addressing scalability collapse on multicore systems, by Yan Cui, Yingxin Wang, Yu Chen, Yuanchun Shi http://dl.acm.org/citation.cfm?id=2400703

ADAPT: A framework for coscheduling multithreaded programs, by Kishore Kumar Pusukuri, Rajiv Gupta, Laxmi N. Bhuyan http://dl.acm.org/citation.cfm?id=2400704

Continuous learning of compiler heuristics, by Michele Tartara, Stefano Crespi Reghizzi http://dl.acm.org/citation.cfm?id=2400705

HC-CART: A parallel system implementation of data mining classification and regression tree (CART) algorithm on a multi-FPGA system, by Grigorios Chrysos, Panagiotis Dagritzikos, Ioannis Papaefstathiou, Apostolos Dollas http://dl.acm.org/citation.cfm?id=2400706

Dynamic code duplication with vulnerability awareness for soft error detection on VLIW architectures, by Jongwon Lee, Yohan Ko, Kyoungwoo Lee, Jonghee M. Youn, Yunheung Paek http://dl.acm.org/citation.cfm?id=2400707

API compilation for image hardware accelerators, by Fabien Coelho, François Irigoin http://dl.acm.org/citation.cfm?id=2400708

Fair CPU time accounting in CMP+SMT processors, by Carlos Luque, Miquel Moreto, Francisco J. Cazorla, Mateo Valero http://dl.acm.org/citation.cfm?id=2400709

Significantly reducing MPI intercommunication latency and power overhead in both embedded and HPC systems, by Pavlos M. Mattheakis, Ioannis Papaefstathiou http://dl.acm.org/citation.cfm?id=2400710

Improved loop tiling based on the removal of spurious false dependences, by Riyadh Baghdadi, Albert Cohen, Sven Verdoolaege, Konrad Trifunović http://dl.acm.org/citation.cfm?id=2400711

OpenStream: Expressiveness and data-flow compilation of OpenMP streaming programs, by Antoniu Pop, Albert Cohen http://dl.acm.org/citation.cfm?id=2400712

Polyhedral parallel code generation for CUDA, by Sven Verdoolaege, Juan Carlos Juega, Albert Cohen, José Ignacio Gómez, Christian Tenllado, Francky Catthoor http://dl.acm.org/citation.cfm?id=2400713

Delta-compressed caching for overcoming the write bandwidth limitation of hybrid main memory, by Yu Du, Miao Zhou, Bruce Childers, Rami Melhem, Daniel Mossé http://dl.acm.org/citation.cfm?id=2400714

Finding good optimization sequences covering program space, by Suresh Purini, Lakshya Jain http://dl.acm.org/citation.cfm?id=2400715

A dynamic self-scheduling scheme for heterogeneous multiprocessor architectures, by Mehmet E. Belviranli, Laxmi N. Bhuyan, Rajiv Gupta http://dl.acm.org/citation.cfm?id=2400716

SCIN-cache: Fast speculative versioning in multithreaded cores, by Anurag Negi, Ruben Titos-Gil http://dl.acm.org/citation.cfm?id=2400717

PARTANS: An autotuning framework for stencil computation on multi-GPU systems, by Thibaut Lutz, Christian Fensch, Murray Cole http://dl.acm.org/citation.cfm?id=2400718

Stream arbitration: Towards efficient bandwidth utilization for emerging on-chip interconnects, by Chunhua Xiao, M-C. Frank Chang, Jason Cong, Michael Gill, Zhangqin Huang, Chunyue Liu, Glenn Reinman, Hao Wu http://dl.acm.org/citation.cfm?id=2400719

---

Hipeac-publicity mailing list Hipeac-publicity@hipeac.net http://www.hipeac.net/mailman/listinfo/hipeac-publicity