(1987a), "Knowledge Representation from Minsky to Newton and Beyond," Applied Artificial Intelligence, vol. (1986b), "Hierarchical, Modular Modelling /Knowledge Representation," Proc. Lastly, a generalization of the hypercube scheme, based on the ideas of shift registers, is also proposed for systems where the number of nodes is a perfect power of 2. of Electrical and Computer Engineering, University of Arizona, Tucson, AZ. The ShuffleNet scheme does provide a higher degree of failure tolerance for global data files, but the hypercube scheme provides more than adequate failure tolerance. (1986a), "DEVS-Scheme: A Lisp-Based Environment for Hierarchical, Modular Discrete Event Models," Tech. (1984), Multifacetted Modelling and Discrete Event Simulation, Academic Press, London and Orlando, FL. (1976), Theory of Modelling and Simulation, Wiley, N. (1986), "A Rule Based Expert Simulation Environment," In: Intelligent Simulation Environments, (Eds: Luker, P. (1986), "The Knowledge-Based Simulation System," IEEE Software, March, 26-37. (1986), "Simulation and Expert Systems - A Taxonomy and Some Examples, Simulation, 46:1, 10-16. P.), SCS Publications, San Diego, CA Google Scholar
(1986), "Expressibility in ROSS, an Object-Oriented Simulation System," In: Artificial Intelligence in Simulation (Eds: Vansteenkiste, G. Kim, Tag Gon (1988), "A Knowledge-Based Environment for Hierarchical Modelling and Simulation," Doctoral Dissertation, University of Arizona, Tucson.(1986), "The impact of Advanced Information Processing on Simulation - an Illustrative Review," Simulation, 46:1, 17-26. (1986), "Applying Artificial Intelligence Techniques to Strategic-level Gaming and Simulation," In: Modelling and Simulation Methodology in the Artificial Intelligence Era, Elzas, M. (1987), "DEVS Formalism: A Framework for Hierarchical Model Development," IEEE Trans. (1984), "Distributed Simulation on Multiprocessors: Specification, Design and Architecture," Doctoral Dissertation, Wayne State University, Detroit. We evaluate their throughput using simulations, and compare it to that of the priority scheme. We also consider two deflection routing schemes, called the simple nonwasting deflection and the priority nonwasting deflection schemes. We find that little buffer space (between one and three packets per link) is necessary to achieve throughput close to that of the infinite buffer case. The results obtained are approximate, but very accurate as simulations indicate, and are given in particularly interesting forms. We evaluate the throughput of both the unbuffered and the buffered version of these schemes for random multiple node-to-node communications. We evaluate their throughput using simulations, and compare it to that of the priority scheme.ĪB - We consider two different hypercube routing schemes, which we call the simple and the priority schemes. N2 - We consider two different hypercube routing schemes, which we call the simple and the priority schemes. Bertsekas is with the Laboratory for Information and Decision Systems, Massachusetts Institute of Technology, Cambridge, MA 02139 USA. Varvarigos is with the Department of Electrical and Computer Engineering, University of Califomia, Santa Barbara, CA 93106 USA. This work was supported by the NSF under Grants NSF-DDM-8903385 and NSF-RIA-08930554, and by the ARO under Grants DAAL03-86-K-0171 and DAAL03-92-G-0309. Manuscript received Decemrevised Septemapproved by IEEWACM TRANSACTIONSO N NETWORKINEGdi tor I. T1 - Performance of Hypercube Routing Schemes With or Without Buffering
0 kommentar(er)
