publication . Bachelor thesis . 2006

A Scalable Run-Time System for NestStep on Cluster Supercomputers

Sohl, Joar;
Open Access English
  • Published: 01 Jan 2006
  • Publisher: Linköpings universitet, Institutionen för datavetenskap
  • Country: Sweden
NestStep is a collection of parallel extensions to existing programming languages. These extensions supports a shared memory model and nested parallelism. NestStep is based the Bulk-Synchronous Programming model. Most of the communication of data in NestStep takes place in a combine/commit phase, which is essentially a reduction followed by a broadcast. The primary aim of the project that this thesis is based on was to develop a runtime system for NestStep-C, the extensions for the C programming language. The secondary aim was to find which tree structure among a selected few is the best for communicating data in the combine/commit phase. This thesis includes in...
free text keywords: NestStep, parallel programming, programming languages, communication tree structures, nested parallelism, Computer Sciences, Datavetenskap (datalogi)
Related Organizations

2. If k  0 , B k={R , B0 , B1 ,... , Bk −1} . That is, the binomial tree of order k  0 comprises the root R, and k binomial subtrees, B0 , B1 , ... , Bk−1 .

(1) Keßler, C. W. 2000. NestStep: Nested Parallelism and Virtual Shared Memory for the BSP Model. J. Supercomput. 17, 3 (Nov. 2000), 245-262.

(3) Valiant, L. G. 1990. A bridging model for parallel computation. Commun. ACM 33, 8 (Aug. 1990), 103-111. [OpenAIRE]

Powered by OpenAIRE Research Graph
Any information missing or wrong?Report an Issue