The University of Dublin | Trinity College -- Ollscoil Átha Cliath | Coláiste na Tríonóide
TARA Trinity's Access to Research Archive
Home :: Log In :: Submit :: Alerts ::

TARA >
School of Computer Science and Statistics >
Computer Science >
Computer Science (Theses and Dissertations) >

Please use this identifier to cite or link to this item: http://hdl.handle.net/2262/783

Title: Testing of a Novel Distributed Shared Memory Framework
Author: Markey, Laurence
Advisor: Tangney, Brendan
Keywords: Computer Science
Issue Date: Sep-1999
Abstract: A novel object oriented framework for software Distributed Shared Memory (DSM) has been developed by the Distributed Systems Group in Trinity College, Dublin for programming parallel applications on a group of loosely coupled workstations. It offers the developer the ability to apply different rules for how accesses to shared data are seen by each process (consistency models) which can be implemented by different means of managing shared data (coherence protocols). Different combinations of models and protocols can be applied to individual objects within an application, in addition the protocols that the framework uses can be customized by the developer. By providing this range of facilities it is hoped that developers will be able to exploit application specific semantics to achieve improvements in performance and speed-up characteristics while maintaining relative ease of programming. The objective of this project is to test to what extent this DSM framework delivers the flexibility, customizability and programmability in design of parallel applications that it promises and whether it can offer appropriate speedup characteristics for different classes of problem. Two applications with significantly different data sharing characteristics were designed and implemented as sample cases to test the framework: the Travelling Sales Person (TSP) problem which has a low communication-to-computation ratio and for which workers can work independently of each other; and the LU Decomposition problem which has a very a high communication-to-computation ratio and an algorithm where workers are highly interdependent The thesis will show that the framework did achieve appropriate speed-up characteristics. It also allows significant flexibility and programmability: protocols can be easily set and changed for individual objects; the protocols themselves were customized to improve the performance of each of the applications.
URI: http://hdl.handle.net/2262/783
Appears in Collections:Computer Science (Theses and Dissertations)
Computer Science Technical Reports

Files in This Item:

File Description SizeFormat
TCD-CS-1999-67.pdf275.76 kBAdobe PDFView/Open


This item is protected by original copyright


Please note: There is a known bug in some browsers that causes an error when a user tries to view large pdf file within the browser window. If you receive the message "The file is damaged and could not be repaired", please try one of the solutions linked below based on the browser you are using.

Items in TARA are protected by copyright, with all rights reserved, unless otherwise indicated.

 

Valid XHTML 1.0! DSpace Software Copyright © 2002-2010  Duraspace - Feedback