Publications
110 results found
Field AJ, Harrison PG, 1995, A Fixed-Point Model of a Distributed Memory Consistency Protocol, Quantitative Methods in Parallel Systems, Editors: Baccelli, Jean-Marie, Mitrani, Baccelli, Jean-Marie, Mitrani, Publisher: Springer Verlag, Pages: 237-247
Field AJ, Harrison PG, 1995, An Analytical Model of the Standard Coherent Interface 'SCI, Proceedings of the International Conference on Parallel Processing, Oconomowoc, Wisconsin, Pages: 173-177
Harrison PG, Field AJ, Lehovesti N, 1994, A Uniform Memory Access Model of a Distributed Coherent Cache System, Proceedings 10th UK Performance Engineering Workshop, Edinburgh
Harrison P, Field T, 1993, Transmission Times in Buffered Full-Crossbar Communication Networks with Cyclic Arbitration, ICPP'93, IEEE/ACM International Conference on Parallel Processing. 16-20 August 1993, Syracuse University, NY, Publisher: IEEE Computer Society, Pages: 189-196
In this paper we consider the distribution of message transmission times in buffered full cross bar interconnection networks with cyclic arbitration in which the input buffers are serviced in a 'round robin' fashion. The system is modelled as an open queue ing network in which the queues appear at the net work outputs and with the cyclic arbiter being mod elled by queue jumping. We obtain the Laplace Trans form of the transmission time by deriving a condi tional Laplace Transform and solving by the use of a generating function. The density function is then enumerated by numerical inversion and compared with similar results from a simulation model. The analysis is then extended to general service times by modelling each output as a LCFS queue with a suitably modified arrival rate. In the special case of exponential service times, this model is less versatile than the previous one since it only works in the case where the jump probability is fixed. In this case, however, it is shown to produce the same result as the original.
Darlington D, Field A J, Harrison P G, et al., 1993, Parallel Programming Using Skeleton Functions, PARLE'93: Parallel Architectures and Languages Europe, Publisher: Springer LNCS, Pages: 146-160
While R, Field T, 1993, Discrete-event Simulation in Functional Languages, Australian Computer Science Communications, Vol: 15, Pages: 265-273
While R, Field T, 1992, Incremental Garbage Collection for the Spineless Tagless G-machine, Massey Functional Programming Workshop
Field T, While R, 1992, A General Framework for Discrete-event Simulation using Functional Languages, Sixth International Conference on Modelling Techniques and Tools for Performance Evaluation, September 1992, Publisher: Edinburgh University Press, Pages: 409-414
In this paper we explore the use of functional programming languages in the design and implementation of discrete-event simulation programs. We show, in particular, how language features such as polmorphism, higher-order functions and lazy evaluation can be used to develop powerful, re-usable, library modules for, among others, event management, simulation monitoring and statistical analysis. We give examples of simulation programs developed within the proposed framework; these illustrate the...
Field T, 1992, An Exercise in the Synthesis of Parallel Functional Programs for Message Passing Architectures, Parallel Computing: From Theory to Sound Practice, Pages: 452-463
Field T, While R, Hunt L, 1992, The Semantics and Implementation of Various Best-fit Pattern Matching Schemes for Functional Languages
FIELD AJ, HARRISON PG, 1992, TRANSMISSION TIMES IN UNBUFFERED CROSSBARS WITH CYCLIC ARBITRATION, 1992 International Conference on Parallel Processing, Publisher: CRC PRESS INC, Pages: 132-137, ISSN: 0190-3918
- Author Web Link
- Cite
- Citations: 1
Field T, Harrison P, 1990, Functional Programming, Publisher: Addison-Wesley
Field T, Harrison P, 1990, Functional Programming, Publisher: Addison-Wesley
Cripps M, Darlington J, Field T, et al., 1987, The Design and Implementation of ALICE - a Parallel Graph Reduction Machine, Selected Reprints on Dataflow and Reduction Architectures, Pages: 300-327
Field T, Reeve M, Cripps M, 1987, An Introduction to ALICE: a Multiprocessor Graph Reduction Machine, Pages: 111-128
Harrison P, Field T, 1986, Performance modelling of parallel computer architectures, Joint International Conference on Measurement and Modeling of Computer Systems, Publisher: ACM Press, Pages: 18-27
In this paper we describe two types of complex server aggregations which can be used to model collections of components in certain types of parallel computer systems and give a case study showing how the aggregations may be applied in practice. Analytical models of such systems are becoming increasingly important as a means of guiding the often complex design processes, particularly since recent developments in VLSI technology now make it possible to fabricate many paper-designs hitherto impractical for reasons of cost. We argue that aggregations of the type described are essential in the modelling of parallel systems; using the proposed techniques, large numbers of components can be modelled as queue-length-dependent servers within a queueing network in which the number of servers is the same as the number of distinct types of processing element in the system being modelled. Because the number of severs in the model is fixed i.e. is independent of the number of processors, very large multiprocessor systems can be modelled efficiently with no explosion in the size of the state space.
Darlington J, Field T, Pull H, 1986, The Unification of Functional and Logic Languages, Publisher: Prentice Hall, Pages: 37-70
Field T, Cripps M, 1985, Self-Clocking Networks, 1985 IEEE/ACM International Conference on Parallel Processing, St. Charles, Illinois, Pages: 384-387
Cripps M, Field T, 1983, A Structure-independent Switching System with System-level Fault Tolerance
This data is extracted from the Web of Science and reproduced under a licence from Thomson Reuters. You may not copy or re-distribute this data in whole or in part without the written consent of the Science business of Thomson Reuters.