|
|||||||||||||||||||||
|
The First International ComplexHPC ChallengeFirst Prize awarded to Roberto Rey Expósito and Sabele Ramos Garea for their submission The F-MPJ Challenge: Solving Complex Problems on Hierachical Architectures with Java. Congratulations!
IntroductionThe First International ComplexHPC Challenge is an integral part of the ComplexHPC Spring School 2011, and is open to all Spring School participants. The Challenge is an excellent opportunity to showcase your work to your peers - and even win a prize in the process. Selected Challenge participants have two opportunities to show a (preferably live) demonstration of their work: a poster and demo session on the first day of the Spring School, and an individual 20-minute presentation and demo on the final day. ObjectiveThe ComplexHPC project description states: In different fields of science and engineering it is necessary to solve complex and challenging problems with high computational cost. For this purpose, scientists and engineers normally use homogeneous high performance computers. Nowadays, the emergence of heterogeneous computing allows research groups, enterprises and educational institutions to use networks of processors which are already available. On the other hand, high performance computers have become more and more hierarchical and heterogeneous (e.g., a cluster of multiprocessor nodes using multicore processors). These modern hierarchical and heterogeneous computing infrastructures are hard to program and use efficiently, particularly for extreme-scale computing. Consequently, none of the state-of-the-art solutions are able to efficiently use such environments. The objective of the First International ComplexHPC Challenge is to demonstrate and highlight state-of-the-art problem solving in the ComplexHPC field, recognizing novel, real-world solutions to the problems present in today's complex, distributed, heterogeneous, and hierarchical computing environments. Solving these problems will realize the ultimate goal of the ComplexHPC project: easy and efficient use of any type of compute resources available to scientists and engineers.
Call for ProposalsThe First International ComplexHPC Challenge will focus on the easy and efficient use of ComplexHPC resources, including (combinations of) grids, clouds, clusters, GPUs, multicores, or any other type of compute resources. Challenge participants must show how their system makes 'efficient' use of ComplexHPC resources, where efficiency can be a measure of performance, scalability, cost, energy use, etc. For use as a possible (or partial) target platform, all selected Challenge participants will be granted access to the DAS-4 system, immediately after acceptance of their proposal. We invite Spring School participants to submit a short paper (4 pages or less; shorter is better) describing their system. A proposal should contain:
Proposals should be send to Jason Maassen (jason AT cs.vu.nl). Based on the proposals, a maximum of 4 Spring School participants will be invited to demonstrate their system during the ComplexHPC Spring School on May 11. The jury will select a winner based on the demonstration and the accompanying presentation. Entries will be judged on the quality of the demonstration, presentation quality, the extent in which combinations of heterogeneous and hierarchical resources are being used, and the overall efficiency of the system. Live demonstrations are strongly encouraged! On May 9th, the participants have the opportunity to test and demonstrate their system during the poster and demo session. Note: members of the HPDC group of the VU University Amsterdam are NOT allowed to participate in this challenge!TimelineFebruary 2011: Call for ProposalsMarch 27, 2011: Proposal Deadline (23:59 CET) March 29, 2011: Notification of acceptance May 9, 2011: Poster and Demo Session May 11, 2011: ComplexHPC Challenge Presentations and demonstrations. May 12, 2011: ComplexHPC Challenge Award Ceremony during Social Event. Presentation Schedule for May 11
PrizesFirst Prize: EUR 250Contact
|
||||||||||||||||||||