No abstract available.
Proceeding Downloads
Revisiting loop transformations with x10 clocks
Loop transformations are known to be important for performance of compute-intensive programs, and are often used to expose parallelism. However, many transformations involving loops often obfuscate the code, and are cumbersome to apply by hand. The ...
Local parallel iteration in x10
X10 programs have achieved high efficiency on petascale clusters by making significant use of parallelism between places, however, there has been less focus on exploiting local parallelism within a place. This paper introduces a standard mechanism - ...
Cutting out the middleman: OS-level support for x10 activities
- Manuel Mohr,
- Sebastian Buchwald,
- Andreas Zwinkau,
- Christoph Erhardt,
- Benjamin Oechslein,
- Jens Schedel,
- Daniel Lohmann
In the X10 language, computations are modeled as lightweight threads called activities. Since most operating systems only offer relatively heavyweight kernel-level threads, the X10 runtime system implements a user-space scheduler to map activities to ...
Optimization of x10 programs with ROSE compiler infrastructure
X10 is a Java-like programming language that introduces new constructs to significantly simplify scale-out programming based on the Asynchronous Partitioned Global Address Space (APGAS) programming model. The fundamental goal of X10 is to enable ...
The APGAS library: resilient parallel and distributed programming in Java 8
We propose the APGAS library for Java 8. Inspired by the core constructs and semantics of the Resilient X10 programming language, APGAS brings many benefits of the X10 programming model to the Java programmer as a pure, idiomatic Java library. APGAS ...
Towards an efficient fault-tolerance scheme for GLB
X10's Global Load Balancing framework GLB implements a user-level task pool for inter-place load balancing. It is based on work stealing and deploys the lifeline algorithm. A single worker per place alternates between processing tasks and answering ...
Scalable parallel numerical constraint solver using global load balancing
We present a scalable parallel solver for numerical constraint satisfaction problems (NCSPs). Our parallelization scheme consists of homogeneous worker solvers, each of which runs on an available core and communicates with others via the global load ...
Index Terms
- Proceedings of the ACM SIGPLAN Workshop on X10
Recommendations
Acceptance Rates
Year | Submitted | Accepted | Rate |
---|---|---|---|
X10 '13 | 5 | 5 | 100% |
Overall | 5 | 5 | 100% |