Using the Cowichan problems to investigate the programmability of X10 programming system

Authors:
Jeeva Paudel;José Nelson Amaral
Affiliations:
University of Alberta, Edmonton, Canada;University of Alberta, Edmonton, Canada
Venue:
Proceedings of the 2011 ACM SIGPLAN X10 Workshop
Year:
2011

Citing 5
Cited 3

Comparative Study of Parallel Programming Languages: The Salishan Problems

Comparative Study of Parallel Programming Languages: The Salishan Problems
Using the Cowichan Problems to Assess the Usability of Orca

IEEE Parallel & Distributed Technology: Systems & Technology
Uses and abuses of Amdahl's law

Journal of Computing Sciences in Colleges
X10: an object-oriented approach to non-uniform cluster computing

OOPSLA '05 Proceedings of the 20th annual ACM SIGPLAN conference on Object-oriented programming, systems, languages, and applications
Asserting the utility of CO2P3S using the Cowichan Problem Set

Journal of Parallel and Distributed Computing

Characterization of Smith-Waterman sequence database search in X10

Proceedings of the 2012 ACM SIGPLAN X10 Workshop
Hybrid parallel task placement in X10

Proceedings of the third ACM SIGPLAN X10 Workshop
X10 and APGAS at Petascale

Proceedings of the 19th ACM SIGPLAN symposium on Principles and practice of parallel programming

Quantified Score

Hi-index	0.00

Visualization

Abstract

In today's era of multicores and clustered architectures, high performance and high productivity are central concerns in the design of parallel programming languages that aim to solve large computational problems. X10 is a language based on state-of-the-art object-oriented programming ideas and claims to take advantage of their proven flexibility and ease-of-use to solve a wide spectrum of programming problems. The Cowichan problems are a set of computational problems that were designed to stress parallel programming environments and to assess their programmability. This paper uses Cowichan problems to assess the flexibility of X10.