Publications
254 results found
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.
Harrison P, 1986, An Enhanced Approximation by Pair-Wise Analysis of Servers for Time Delay Distributions in Queueing Networks, IEEE Transactions on Computers, Vol: 35, Pages: 54-61
An approximation for the distribution of time delays experienced by a customer in a network of queues is presented. Approximate analytical models are necessary since exact solutions are only available for a very restricted class of networks, and are too complex computationally to be viable in practice. Approximations have so far often proved inadequate, particularly for closed networks with first come first served queueing disciplines. We also prove that the correlation between the sojourn times at successive servers on a customer's path in a closed queueing network with exponential servers is negative.
HARRISON PG, KHOSHNEVISAN H, 1985, FUNCTIONAL PROGRAMMING USING FP, BYTE, Vol: 10, Pages: 219-&, ISSN: 0360-5280
- Author Web Link
- Cite
- Citations: 7
HARRISON PG, 1985, ON NORMALIZING CONSTANTS IN QUEUING-NETWORKS, OPERATIONS RESEARCH, Vol: 33, Pages: 464-468, ISSN: 0030-364X
- Author Web Link
- Cite
- Citations: 27
HARRISON PG, 1984, THE DISTRIBUTION OF CYCLE TIMES IN TREE-LIKE NETWORKS OF QUEUES, COMPUTER JOURNAL, Vol: 27, Pages: 27-36, ISSN: 0010-4620
- Author Web Link
- Cite
- Citations: 2
HARRISON PG, 1984, AN ANALYTIC MODEL FOR FLOW-CONTROL SCHEMES IN COMMUNICATION-NETWORK NODES, IEEE TRANSACTIONS ON COMMUNICATIONS, Vol: 32, Pages: 1013-1019, ISSN: 0090-6778
- Author Web Link
- Cite
- Citations: 2
HARRISON PG, 1984, A NOTE ON CYCLE TIMES IN TREE-LIKE QUEUING-NETWORKS, ADVANCES IN APPLIED PROBABILITY, Vol: 16, Pages: 216-219, ISSN: 0001-8678
- Author Web Link
- Cite
- Citations: 11
Harrison P, 1983, An exact analysis of the distribution of cycle times in a class of queueing networks, SIGMETRICS'83, ACM SIGMETRICS conference on Measurement and Modeling of Computer Systems, Publisher: ACM, Pages: 224-242
Prediction of detailed characteristics of the time delays experienced by customers in queueing networks is of great importance in various modelling and performance evaluation activities: operations research, computer systems and communication networks. Their statistical properties have been investigated predominantly by simulation techniques with the exception of mean value analyses for which Little's Law is applied. Theoretical studies of the probability distributions of time delays tend to be based on their Laplace transforms, which are of limited use, can be inverted analytically only in very simple cases and present substantial computation problems for numerical inversion. An exact derivation is presented for the distribution of cycle times in so called tree-like queueing networks. The analysis is performed for a network structure which is such that it is not necessary to mark a special customer, so avoiding expansion of the state space. Cycle time distribution is derived initially in the form of its Laplace Transform, from which its moments follow. A recurrence relation for a uniformly convergent discrete representation of the distribution then follows by a similar argument. Finally, the numerical results obtained for some simple test networks are presented and compared with those corresponding to an approximate method, hence indicating the accuracy of the latter.
HARRISON PG, 1982, EFFICIENT STORAGE MANAGEMENT FOR FUNCTIONAL LANGUAGES, COMPUTER JOURNAL, Vol: 25, Pages: 264-271, ISSN: 0010-4620
- Author Web Link
- Cite
- Citations: 1
HARRISON PG, 1982, CONVERGENT DISCRETE FORM FOR TIME-DELAY DISTRIBUTIONS IN NETWORKS OF QUEUES, COMPUTER PERFORMANCE, Vol: 3, Pages: 167-175, ISSN: 0143-9642
- Author Web Link
- Cite
- Citations: 1
Harrison P, 1981, Approximate Analysis and Prediction of Time Delay Distributions in Networks of Queues, 7th International Computer Measurement Group Conference, New Orleans, December 1-4, 1981, Publisher: Computer Measurement Group, Pages: 70-80
HARRISON PG, 1981, EFFICIENT TABLE-DRIVEN IMPLEMENTATION OF THE FINITE STATE MACHINE, JOURNAL OF SYSTEMS AND SOFTWARE, Vol: 2, Pages: 201-211, ISSN: 0164-1212
- Author Web Link
- Cite
- Citations: 1
HARRISON PG, 1981, TRANSIENT-BEHAVIOR OF QUEUING-NETWORKS, JOURNAL OF APPLIED PROBABILITY, Vol: 18, Pages: 482-490, ISSN: 0021-9002
- Author Web Link
- Cite
- Citations: 11
HASKELL R, HARRISON PG, 1980, SYSTEM CONVENTIONS FOR NON PROCEDURAL LANGUAGES, COMPUTER JOURNAL, Vol: 23, Pages: 132-141, ISSN: 0010-4620
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.