RELEASE: A High-level Paradigm for Reliable Large-scale Server Software

Erlang is a functional language with a much-emulated model for building reliable distributed systems. This paper outlines the RELEASE project, and describes the progress in the rst six months. The project aim is to scale the Erlang's radical concurrency-oriented programming paradigm to build reliable general-purpose software, such as server-based systems, on massively parallel machines. Currently Erlang has inherently scalable computation and reliability models, but in practice scalability is constrained by aspects of the language and virtual machine. We are working at three levels to address these challenges: evolving the Erlang virtual machine so that it can work effectively on large scale multicore systems; evolving the language to Scalable Distributed (SD) Erlang; developing a scalable Erlang infrastructure to integrate multiple, heterogeneous clusters. We are also developing state of the art tools that allow programmers to understand the behaviour of massively parallel SD Erlang programs. We will demonstrate the e ectiveness of the RELEASE approach using demonstrators and two large case studies on a Blue Gene

Preparing sparse solvers for exascale computing.

Sparse solvers provide essential functionality for a wide variety of scientific applications. Highly parallel sparse solvers are essential for continuing advances in high-fidelity, multi-physics and multi-scale simulations, especially as we target exascale platforms. This paper describes the challenges, strategies and progress of the US Department of Energy Exascale Computing project towards providing sparse solvers for exascale computing platforms. We address the demands of systems with thousands of high-performance node devices where exposing concurrency, hiding latency and creating alternative algorithms become essential. The efforts described here are works in progress, highlighting current success and upcoming challenges. This article is part of a discussion meeting issue 'Numerical algorithms for high-performance computational science'

Support of the collaborative inquiry learning process: influence of support on task and team regulation

Regulation of the learning process is an important condition for efficient and effective learning. In collaborative learning, students have to regulate their collaborative activities (team regulation) next to the regulation of their own learning process focused on the task at hand (task regulation). In this study, we investigate how support of collaborative inquiry learning can influence the use of regulative activities of students. Furthermore, we explore the possible relations between task regulation, team regulation and learning results. This study involves tenth-grade students who worked in pairs in a collaborative inquiry learning environment that was based on a computer simulation, Collisions, developed in the program SimQuest. Students of the same team worked on two different computers and communicated through chat. Chat logs of students from three different conditions are compared. Students in the first condition did not receive any support at all (Control condition). In the second condition, students received an instruction in effective communication, the RIDE rules (RIDE condition). In the third condition, students were, in addition to receiving the RIDE rules instruction, supported by the Collaborative Hypothesis Tool (CHT), which helped the students with formulating hypotheses together (CHT condition). The results show that students overall used more team regulation than task regulation. In the RIDE condition and the CHT condition, students regulated their team activities most often. Moreover, in the CHT condition the regulation of team activities was positively related to the learning results. We can conclude that different measures of support can enhance the use of team regulative activities, which in turn can lead to better learning results

The Integration of Task and Data Parallel Skeletons

We describe a skeletal parallel programming library which integrates task and data parallel constructs within an API for C++. Traditional skeletal requirements for higher orderness and polymorphism are achieved through exploitation of operator overloading and templates, while the underlying parallelism is provided by MPI. We present a case study describing two algorithms for the travelling salesman problem