Search

Your search keyword '"Colbrook, Adrian"' showing total 214 results
Start Over Author "Colbrook, Adrian"

Refine your results

more »

more »

more »

more »
214 results on '"Colbrook, Adrian"'

1. PRELUDE: A System for Portable Parallel Software

Author

Weihl, William Edward, Brewer, Eric A., Colbrook, Adrian, Dellarocas, Chrysanthos N., Hsieh, Wilson, Joseph, Anthony, Waldspurger, Carl, Wang, Paul, Weihl, William Edward, Brewer, Eric A., Colbrook, Adrian, Dellarocas, Chrysanthos N., Hsieh, Wilson, Joseph, Anthony, Waldspurger, Carl, and Wang, Paul

Abstract

This paper describes PRELUDE, a programming language and accompanying system support for writing portable MIMD parallel programs. PRELUDE supports a methodology for designing and organizing parallel programs that makes them easier to tune for particular architectures and to port to new architectures.

Published
2023

2. Algorithms for Search Trees on Message-passing Architectures

Author

Colbrook, Adrian, Brewer, Eric A., Dellarocas, Chrysanthos N., Weihl, William E., Colbrook, Adrian, Brewer, Eric A., Dellarocas, Chrysanthos N., and Weihl, William E.

Abstract

In this paper we describe a new algorithm for maintaining a balanced search tree on a message-passing MIMD architecture; the algorithm is particularly well suited for implementation on a small number of processors.

Published
2023

3. Proteus: A High-performance Parallel-architecture Simulator

Author

Brewer, Eric A., Dellarocas, Chrysanthos N., Colbrook, Adrian, Weihl, William E., Brewer, Eric A., Dellarocas, Chrysanthos N., Colbrook, Adrian, and Weihl, William E.

Abstract

PROTEUS is a high-performance simulator for MIMD multiprocessors. It is fast, accurate, and flexible: it is one to two orders of magnitude faster than comparable simulators, it can reproduce results from real multiprocessors, and it is easily configured to simulate a wide range of architectures.

Published
2023

4. A Distributed Data-balanced Dictionary Based on the B-link tree

Author

Johnson, Theodore, Colbrook, Adrian, Johnson, Theodore, and Colbrook, Adrian

Abstract

Many concurrent dictionary data structures have been proposed, but usually in the context of shared memory multiprocessors. In this paper, we present an algorithm for a concurrent distributed B-tree that can be implemented on message passing paralle

Published
2023

5. PIPES: Linguistic Support for Ordered Asynchronous Invocations

Author

Colbrook, Adrian, Brewer, Eric A., Hsieh, Wilson C., Wang, Paul, Weihl, William E., Colbrook, Adrian, Brewer, Eric A., Hsieh, Wilson C., Wang, Paul, and Weihl, William E.

Abstract

We describe pipes, a new linguistic mechanism for sequences of ordered asynchronous procedure calls in multiprocessor systems. Pipes allow a sequence of remote invocations to be performed in order, but asynchronously with respect to the calling thread.

Published
2023

6. The engineering of data structures

Author

Colbrook, Adrian

Subjects
005, Computer programming technique
Abstract

Abstraction in computer programming provides a means of reducing complexity by emphasising the significant information (program behaviour) whilst suppressing the immaterial (program implementation). This aids program construction, improves reliability and maintainability, and eases the application of formal correctness proofs. The importance of data abstraction in the specification, design and implementation of large systems raises the question as to whether such methods may be applied in the context of programming languages designed before the widespread use of abstraction techniques. The program structuring facilities available in FORTRAN 77 support a form of encapsulation for simple data structures. In light of this mechanism provided by the language, state-based specification was found to be most appropriate. A specification technique incorporating object-oriented techniques is particularly suitable and allows a library of object classes to be specified and then implemented in sequential FORTRAN 77. Refinement extends the object classes so as to provide the commonly occurring generators for use in iterative constructs. Therefore, the advantages of data abstraction methods may be obtained in an early procedural language such as FORTRAN 77. Data abstraction provides data independence : a change in the representation for a particular class of objects affects only the code that implements the associated operations. This allows parallel implementations to be considered, without changes to the original specification or to any user-code. The provision of such parallel data structures is required for the migration of sequential systems onto parallel distributed memory architectures. As an illustration of this approach a general 2P2-2P (for integer P≥3) search tree utilising a pipeline of processors in a distributed memory architecture is shown to provide a means of implementing the object classes. Variations in both the number of processors allocated to the pipeline and the value of P allows the optimal search structure for a given architecture to be determined. These structures are highly efficient leading to improvements in both throughput and response time as processors are added to the array. An efficient parallel implementation of object classes is therefore achieved within the tight interface provided by abstraction.

Published
1990

7. Real industrial HPC applications

Author

Elliott, John A, Brindle, Stephen H, Colbrook, Adrian, Green, Daron G, Wray, Francis, Goos, Gerhard, editor, Hartmanis, Juris, editor, van Leeuwen, Jan, editor, Liddell, Heather, editor, Colbrook, Adrian, editor, Hertzberger, Bob, editor, and Sloot, Peter, editor

Published
1996
Full Text
View/download PDF

10. Concurrent data structures

Author

Colbrook, Adrian, Smythe, Colin, Goos, G., editor, Hartmanis, J., editor, Barstow, D., editor, Brauer, W., editor, Brinch Hansen, P., editor, Gries, D., editor, Luckham, D., editor, Moler, C., editor, Pnueli, A., editor, Seegmüller, G., editor, Stoer, J., editor, Wirth, N., editor, Akl, S. G., editor, Fiala, F., editor, and Koczkodaj, W. W., editor

Published
1990
Full Text
View/download PDF

11. Algorithms for search trees on message-passing architectures

Author

Colbrook, Adrian, Brewer, Eric A., Dellarocas, Chrysanthos N., and Weihl, William E.

Subjects
Algorithms -- Research, Array processors -- Analysis, Tree structures (Computers) -- Research, Business, Computers, Electronics, Electronics and electrical industries
Abstract

A novel algorithm efficiently develops a (2{super B-2}, 2{super B}) search tree to store 'n' entries on a message-passing MIMD architecture. The search tree uses a bidirectional ring of O(log n) processors having a large local memory. A bottom-up node-splitting algorithm requires less messages and produces lesser blocking due to synchronization compared to top-down algorithms. The algorithm permits the asynchronous performance of transformations because of changes in the tree structure from the leaf nodes upwards while retaining the accuracy of other operations.

Published
1996

12. Prelude: A system for portable parallel software

Author

Weihl, William, Brewer, Eric, Colbrook, Adrian, Dellarocas, Chrysanthos, Hsieh, Wilson, Joseph, Anthony, Waldspurger, Carl, Wang, Paul, Goos, Gerhard, editor, Hartmanis, Juris, editor, Etiemble, Daniel, editor, and Syre, Jean-Claude, editor

Published
1992
Full Text
View/download PDF

13. Prelude: A system for portable parallel software

Author

Weihl, William, primary, Brewer, Eric, additional, Colbrook, Adrian, additional, Dellarocas, Chrysanthos, additional, Hsieh, Wilson, additional, Joseph, Anthony, additional, Waldspurger, Carl, additional, and Wang, Paul, additional

Published
1992
Full Text
View/download PDF

19. The engineering of data structures

Author

Colbrook, Adrian.

Abstract

ion in computer programming provides a means of reducing complexity by emphasising the significant information (program behaviour) whilst suppressing the immaterial (program implementation). This aids program construction, improves reliability and maintainability, and eases the application of formal correctness proofs. The importance of data abstraction in the specification, design and implementation of large systems raises the question as to whether such methods may be applied in the context of programming languages designed before the widespread use of abstraction techniques. The program structuring facilities available in FORTRAN 77 support a form of encapsulation for simple data structures. In light of this mechanism provided by the language, state-based specification was found to be most appropriate. A specification technique incorporating object-oriented techniques is particularly suitable and allows a library of object classes to be specified and then implemented in sequential FORTRAN 77. Refinement extends the object classes so as to provide the commonly occurring generators for use in iterative constructs. Therefore, the advantages of data abstraction methods may be obtained in an early procedural language such as FORTRAN 77. Data abstraction provides data independence : a change in the representation for a particular class of objects affects only the code that implements the associated operations. This allows parallel implementations to be considered, without changes to the original specification or to any user-code. The provision of such parallel data structures is required for the migration of sequential systems onto parallel distributed memory architectures. As an illustration of this approach a general 2P2-2P (for integer P≥3) search tree utilising a pipeline of processors in a distributed memory architecture is shown to provide a means of implementing the object classes. Variations in both the number of processors allocated to the pipeline and the value of P allows the optimal search structure for a given architecture to be determined. These structures are highly efficient leading to improvements in both throughput and response time as processors are added to the array. An efficient parallel implementation of object classes is therefore achieved within the tight interface provided by abstraction.

Published
1990

21. Pipes: Linguistic Support for Ordered Asynchronous Invocations

Author

MASSACHUSETTS INST OF TECH CAMBRIDGE LAB FOR COMPUTER SCIENCE, Colbrook, Adrian, Brewer, Eric A., Hsieh, Wilson C., Wang, Paul, Weihl, William E., MASSACHUSETTS INST OF TECH CAMBRIDGE LAB FOR COMPUTER SCIENCE, Colbrook, Adrian, Brewer, Eric A., Hsieh, Wilson C., Wang, Paul, and Weihl, William E.

Abstract

We describe pipes, a new linguistic mechanism for sequences of ordered asynchronous procedure calls in multiprocessor systems. Pipes allow a sequence of remote invocations to be performed in order, but asynchronously with respect to the calling thread. Using pipes results in programs that are easier to understand and debug than those with explicit synchronization between asynchronous invocations. The semantics of pipes make no assumptions about the underlying architecture, which enhances code portability. However, the implementation of pipes by the language compiler can be optimized so as to take advantage of any underlying message ordering a particular architecture may provide. Pipes also provide application-transparent flow control for asynchronous invocations and are able to throttle invocations from multiple calling threads. We present four implementations of pipes and show that the performance and space overheads associated with pipes are low., Sponsored in part by ONR.

Published
1992

22. Algorithms for Search Trees on Message-Passing Architectures

Author

MASSACHUSETTS INST OF TECH CAMBRIDGE LAB FOR COMPUTER SCIENCE, Brewer, Eric A., Dellarocas, Chrysanthos N., Colbrook, Adrian, Weihl, William E., MASSACHUSETTS INST OF TECH CAMBRIDGE LAB FOR COMPUTER SCIENCE, Brewer, Eric A., Dellarocas, Chrysanthos N., Colbrook, Adrian, and Weihl, William E.

Abstract

This paper describes a new algorithm for maintaining a balanced search tree on a message-passing MIMD architecture; the algorithm is particularly well suited for implementation on a small number of processors. We introduce a search tree that uses a linear array of processors to store n entries. Update operations use a bottom-up node-splitting scheme, which performs better than top-down search tree algorithms. Additionally, for a given cost ratio of computation to communication the value of B may be varied to maximize performance. Implementations on a parallel-architecture simulator are described.

Published
1991

23. Prelude: A System for Portable Parallel Software

Author

MASSACHUSETTS INST OF TECH CAMBRIDGE LAB FOR COMPUTER SCIENCE, Weihl, William, Brewer, Eric, Colbrook, Adrian, Dellarocas, Chrysanthos, Hsieh, Wilson, Joseph, Anthony, Waidspurger, Carl, Wang, Paul, MASSACHUSETTS INST OF TECH CAMBRIDGE LAB FOR COMPUTER SCIENCE, Weihl, William, Brewer, Eric, Colbrook, Adrian, Dellarocas, Chrysanthos, Hsieh, Wilson, Joseph, Anthony, Waidspurger, Carl, and Wang, Paul

Abstract

In this paper we describe PRELUDE, a programming language and accompanying system support for writing portable MIMD parallel programs. PRELUDE supports methodology for designing and organizing parallel programs that makes them easier to tune for particular architectures and to port to new architectures. It builds on earlier work on Emerald, Amber, and various Fortran extensions to allow the programmer to divide programs into architecture-dependent and architecture-independent parts, and then to change the architecture-dependent parts to port the program to a new machine or to tune its performance on a single machine. The architecture-dependent parts of a program are specified by annotations that describe the mapping of a program onto a machine. PRELUDE provides a variety of mapping mechanisms similar to those in other systems, including remote procedure call, object migration, and data replication and partitioning. In addition, PRELUDE includes novel migration mechanisms for computations based on a form of continuation passing. The implementation of object migration in PRELUDE uses a novel approach based on fixup blocks that is more efficient than previous approaches, and amortizes the cost of each migration so that the cost per migration drops as the frequency of migrations increases.

Published
1991

24. PROTEUS: A High-Performance Parallel-Architecture Simulator

Author

MASSACHUSETTS INST OF TECH CAMBRIDGE LAB FOR COMPUTER SCIENCE, Brewer, Eric A., Dellarocas, Chrysanthos N., Colbrook, Adrian, Weihl, William E., MASSACHUSETTS INST OF TECH CAMBRIDGE LAB FOR COMPUTER SCIENCE, Brewer, Eric A., Dellarocas, Chrysanthos N., Colbrook, Adrian, and Weihl, William E.

Abstract

PROTEUS is a high-performance simulator for MIMD multiprocessors. It is fast, accurate, and flexible: it is one to two orders of magnitude faster than comparable simulators, it can reproduce results from real multiprocessors, and it is easily configured to simulate a wide range of architectures. PROTEUS provides a modular structure that simplifies customization and independent replacement of parts of architecture. There are typically multiple implementations of each module that provide different combinations of accuracy and performance; users pay for accuracy only when and where they need it. Finally, PROTEUS provides repeatability, nonintrusive monitoring and debugging, and integrated graphical output, which result in a development environment superior to those available on real multiprocessors.

Published
1991

25. Editorial

Author

Colbrook, Adrian, primary, Duff, Iain, additional, Hey, Tony, additional, Stüben, Klaus, additional, and Thole, Clemens-August, additional

Published
1997
Full Text
View/download PDF

27. Pipes

Author

Brewer, Eric A., primary, Colbrook, Adrian, additional, Hsieh, Wilson C., additional, Wang, Paul, additional, and Weihl, William E., additional

Published
1993
Full Text
View/download PDF

30. Portable software for multiprocessor systems

Author

Colbrook, Adrian, primary, Weihl, William E., additional, Brewer, Eric A., additional, Dellarocas, Chrysanthos N., additional, Hsieh, Wilson C., additional, Joseph, Anthony D., additional, Waldspurger, Carl A., additional, and Wang, Paul, additional

Published
1992
Full Text
View/download PDF

31. EUROPORT2: increasing industrial awareness of high-performance computing in Europe.

Author

Elliott, John, Colbrook, Adrian, Lemke, Max, and Wray, Francis

Subjects
*COMPUTER systems, *COMPUTERS
Abstract

Presents an update on the implementation of the European ESPRIT project EUROPORT2 which aimed to increase awareness and confidence in parallel high performance computing for commercial and industrial applications. Description of EUROPORT2; Details on computers used in the project; Activities on the dissemination of the results of the project.

Published
1995

33. Editorial.

Author

Colbrook, Adrian, Duff, Iain, Hey, Tony, Stüben, Klaus, and Thole, Clemens-August

Published
1997
Full Text
View/download PDF

35. Conjugate-gradients algorithms on a Cray-T3D

Author

Fornasari, Nicoletta, Rovida, Sergio, Goos, Gerhard, editor, Hartmanis, Juris, editor, van Leeuwen, Jan, editor, Liddell, Heather, editor, Colbrook, Adrian, editor, Hertzberger, Bob, editor, and Sloot, Peter, editor

Published
1996
Full Text
View/download PDF

36. Parallel sparse modified Gram-Schmidt QR decomposition

Author

Doallo, Ramón, Fraguela, Basilio B., Touriño, Juan, Zapata, Emilio L., Goos, Gerhard, editor, Hartmanis, Juris, editor, van Leeuwen, Jan, editor, Liddell, Heather, editor, Colbrook, Adrian, editor, Hertzberger, Bob, editor, and Sloot, Peter, editor

Published
1996
Full Text
View/download PDF

39. Bond — A parallel virtual environment

Author

Sirbu, Mihai G., Marinescu, Dan C., Goos, Gerhard, editor, Hartmanis, Juris, editor, van Leeuwen, Jan, editor, Liddell, Heather, editor, Colbrook, Adrian, editor, Hertzberger, Bob, editor, and Sloot, Peter, editor

Published
1996
Full Text
View/download PDF

42. Image convolutions by quadrics Q1

Author

Rocca, A. B. Della, Ferriani, S., La Porta, L., Goos, Gerhard, editor, Hartmanis, Juris, editor, van Leeuwen, Jan, editor, Liddell, Heather, editor, Colbrook, Adrian, editor, Hertzberger, Bob, editor, and Sloot, Peter, editor

Published
1996
Full Text
View/download PDF

45. Computational steering

Author

van Liere, Robert, Mulder, Jurriaan D., van Wijk, Jarke J., Goos, Gerhard, editor, Hartmanis, Juris, editor, van Leeuwen, Jan, editor, Liddell, Heather, editor, Colbrook, Adrian, editor, Hertzberger, Bob, editor, and Sloot, Peter, editor

Published
1996
Full Text
View/download PDF

48. The Remote Computation System

Author

Arbenz, Peter, Gander, Walter, Oettli, Michael, Goos, Gerhard, editor, Hartmanis, Juris, editor, van Leeuwen, Jan, editor, Liddell, Heather, editor, Colbrook, Adrian, editor, Hertzberger, Bob, editor, and Sloot, Peter, editor

Published
1996
Full Text
View/download PDF

Catalog

Books, media, physical & digital resources
See catalog results