Please use this identifier to cite or link to this item:
|Title:||THE IMPLEMENTATION OF BALINDA C AND C++ FOR SUN SYSTEMS||Authors:||WANG QUN||Issue Date:||1998||Citation:||WANG QUN (1998). THE IMPLEMENTATION OF BALINDA C AND C++ FOR SUN SYSTEMS. ScholarBank@NUS Repository.||Abstract:||This thesis focuses on the implementation ofBaLinda C and C++ on SUN SPARCsever I 000 which is a multithread-based system. BaLinda C and C++ are designed by adding six construct key words to standard C and C++. In BaLinda C, parallel statements, EXEC, ENDOFTASK and SYNCHRONIZE are used for parallel tasks creation and synchronization, while tuple statements are introduced for data exchanges among tasks. Tuplespace, a shared collection of logical tuples, plays an important role in infom1ation exchanges and task synchronization. In BaLinda C++, the same parallel statements are added to create and synchronize parallel methods and objects. Also, we build a distributed tuplespace to support communication within one object and among different objects. We built two preprocessors, BaLinda C preprocessor and BaLinda C++ Preprocessor. The output of the BaLinda C/C++ preprocessor is Solaris threaded C/C++ codes which are compiled by the SUN's native C and C++ compiler, and linked with tuplespace library. Multithread-based implementation of BaLinda C/C++ is machine independent. The BaLinda C/C++ example programs and performance data listed in this thesis demonstrate: I) BaLinda C/C++ provides effective and easy-to-use mechanisms for tasks/objects controls and synchronization. 2) The language extensions of BaLinda C/C++ provide programmers a clear and safe interface to write parallel codes. 3) It is easy to learn BaLinda C/C++ because of its similarity to standard C/C++. 4) BaLinda C/C++ is appropriate for applications of coarse-grained and medium grained parallelism.||URI:||https://scholarbank.nus.edu.sg/handle/10635/153418|
|Appears in Collections:||Master's Theses (Restricted)|
Show full item record
Files in This Item:
|b20839868.pdf||2.8 MB||Adobe PDF|
checked on May 12, 2019
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.