• Subscribe

At Science Node, we need your help. We have ALMOST reached our fund-raising goal. In order to maintain our independence as a source of unbiased news and information, we don’t take money from big tech corporations. That’s why we’re asking our readers to help us raise the final $10,000 we need to meet our budget for the year. Donate now to Science Node's Gofundme campaign. Thank you!

Call for papers-IWOMP 2011

The International Workshop on OpenMP 2011 is seeking submissions of unpublished technical papers detailing innovative, original research and development related to OpenMP.

All topics related to OpenMP are of interest, including OpenMP applications in any domain (e.g., scientific computation, video games, computer graphics, multimedia, information retrieval, optimization, text processing, data mining, finance, signal and image processing and numerical solvers), OpenMP performance analysis and modeling, OpenMP performance and correctness tools and proposed OpenMP extensions.

Advances in technologies, such as multi-core processors and accelerators (e.g., GPGPU, FPGA), the use of OpenMP in very large-scale parallel systems, and recent developments in OpenMP itself (e.g., tasking) present new opportunities and challenges for software and hardware developers. IWOMP 2011 solicits submissions that highlight OpenMP work on these fronts.

Submitted papers for review should be limited to 12 pages and follow LNCS guidelines. Submission deadline is Jan. 31, 2011. Submit your paper to: http://www.easychair.org/conferences/?conf=iwomp11.

Authors of accepted papers will be asked to prepare a final paper of up to 15 pages. As in previous years, IWOMP 2011 will publish formal proceedings of the accepted papers in Springer Verlag's LNCS series.

More information at: www.ncsa.illinois.edu/Conferences/IWOMP11/

Copyright © 2019 Science Node ™  |  Privacy Notice  |  Sitemap

Disclaimer: While Science Node ™ does its best to provide complete and up-to-date information, it does not warrant that the information is error-free and disclaims all liability with respect to results from the use of the information.