Title : 
Sharing the Garden GATE: towards an efficient uniform programming model for CLUMPS
         
        
            Author : 
Butler, Darren ; Roe, Paul
         
        
            Author_Institution : 
Sch. of Comput. Sci., Queensland Univ. of Technol., Brisbane, Qld., Australia
         
        
        
        
        
        
            Abstract : 
Gardens integrates a programming language and system to support parallel computation over a network of workstations. Our goal is to develop extensions to Gardens allowing it to efficiently support clusters of SMP machines under a uniform programming model. Such support requires the implementation of high-performance shared memory message passing primitives as well as changes to the existing model invariants and the Gardens runtime system itself: The new communication primitives have demonstrated a minimum latency of 2.0 microseconds and can maintain a maximum bandwidth of approximately 194 MB/s on our test system. The NAS benchmarks, EP and CG have also demonstrated significant performance increases when parallelised by Gardens. The major contribution of this work is a system that efficiently supports multiprocessor computers in a network of workstations with a uniform programming model. Such a system promises to greatly simplify the task of developing high-performance parallel applications to run on CLUMPS
         
        
            Keywords : 
message passing; network operating systems; workstation clusters; CLUMPS; Garden GATE; clusters of SMP machines; minimum latency; multiprocessor computers; network of workstations; uniform programming model; Bandwidth; Benchmark testing; Character generation; Computer languages; Computer networks; Concurrent computing; Delay; Message passing; System testing; Workstations;
         
        
        
        
            Conference_Titel : 
Cluster Computing, 1999. Proceedings. 1st IEEE Computer Society International Workshop on
         
        
            Conference_Location : 
Melbourne, Vic.
         
        
            Print_ISBN : 
0-7695-0343-8
         
        
        
            DOI : 
10.1109/IWCC.1999.810896