X10 (programming language)
|Designed by||Kemal Ebcioğlu, Vijay Saraswat, and Vivek Sarkar|
2.6.2 / January 8, 2019
|Typing discipline||Static, strong, safe, constrained|
|OS||IBM AIX, Linux, Mac OS X, Windows|
|License||Eclipse Public License 1.0|
X10 is a programming language being developed by IBM at the Thomas J. Watson Research Center as part of the Productive, Easy-to-use, Reliable Computing System (PERCS) project funded by DARPA's High Productivity Computing Systems (HPCS) program. Its primary authors are Saravanan Arumugam (Aswath), Kemal Ebcioğlu, Vijay Saraswat, and Vivek Sarkar.
X10 is designed specifically for parallel computing using the partitioned global address space (PGAS) model. A computation is divided among a set of places, each of which holds some data and hosts one or more activities that operate on those data. It has a constrained type system for object-oriented programming, a form of dependent types. Other features include user-defined primitive struct types; globally distributed arrays, and structured and unstructured parallelism.
X10 uses the concept of parent and child relationships for activities to prevent the lock stalemate that can occur when two or more processes wait for each other to finish before they can complete. An activity may spawn one or more child activities, which may themselves have children. Children cannot wait for a parent to finish, but a parent can wait for a child using the finish command.
- Coarray Fortran
- Non-blocking algorithm
- Parallel programming model
- Unified Parallel C
- Ebcioğlu, Kemal; Saraswat, Vijay; Sarkar, Vivek. "X10: Programming for Hierarchical Parallelism and NonUniform Data Access". CiteSeerX 10.1.1.135.9826. Cite journal requires
- Saraswat, Vijay; Bloom, Bard; Peshansky, Igor; Tardieu, Olivier; Grove, David (January 4, 2019). "X10 Language Specification Version 2.6.2" (PDF). Cite journal requires
- Biever, C. "Computer revolution poses problems for programmers". New Scientist. 193 (2594).
|This programming-language-related article is a stub. You can help Wikipedia by expanding it.|