John R. Davy

Learn More
Conventionally, interaction in Parallel and Distributed systems is achieved through the use of either Message Passing or Shared Memory. This paper presents the case for an alternative mechanism supportinghigh-performance sharing in applications; Shared Abstract Data-types (SADTs). An example of the class of SADTs, a highly concurrent FIFO queue, is used to(More)
Currently most of the proprietary GIS software systems lack sophisticated geographical analysis technology. Attempts over the last decade to persuade the system developers to add spatial analysis functionality has so far failed to have much visible impact. The traditional arguments seemingly still apply; viz. no strong market demand, fear of statistical(More)
This paper demonstrates the utility of typed shared data abstractions as an effective high-level means of structuring and coordinating parallel programs. Access to data shared by concurrent processes is expressed through operations of shared abstract data types (SADTs). SADTs abstract low-level concerns of communication and synchronization. The exposition(More)
A standard scalable parallel architecture is now emerging: A set of processor/memory pairs access a point-to-point network router which provides uniform remote access latencies. Hardware scalability is achieved through the additional memory bandwidth and the use of high performance switches o ering linear increases in bisection bandwidth. The issue of(More)
This paper describes a strategy for the structuring and analysis of parallel code, using shared abstract data types (SADTs). SADTs are used to provide both scalability, and a way of supporting modular and portable code development. An example of their usage is presented for a dynamic load balancing method. A framework for performance analysis is described,(More)
This paper demonstrates the utility of typed shared data abstractions as an effective high-level means of structuring and coordinating parallel programs. Access to data shared by concurrent processes is expressed through operations of Shared Abstract Data Types (SADTs). SADTs abstract low-level concerns of communication and synchronisation. The exposition(More)
Several authors have proposed the use of algorithmic skeletons as a highlevel, machine-independent means of developing parallel programs. This paper addresses the question of modelling the performance of such skeletons. The execution time for a skeleton is presented as a generic higher order complexity function. Instantiation of the skeletion with a speci c(More)