Superfast parallel discrete event simulations

Albert G. Greenberg; Boris D. Lubachevsky; Isi Mitrani

首页> 外文期刊>ACM Transactions on Modeling and Computer Simulation: A Publication of the Association for Computing Machinery >Superfast parallel discrete event simulations

【24h】

Superfast parallel discrete event simulations

机译：Superfast parallel discrete event simulations

获取原文

获取原文并翻译 | 示例

掌桥外文数据库（机构版） >>

开具论文收录证明 >>

文献代查 >>

页面导航

摘要
著录项
相关主题

摘要

Nonconventional parallel simulations methods are presented, wherein speed-ups are not limited by the number of simulated components. The methods capitalize on Chandy and Sherman's space-time relaxation paradigm, and incorporate fast algorithms for solving recurrences. Special attention is paid to implementing these algorithms on currently available massively parallel SIMD computers. As examples, “superfast” simulations for open and closed queuing networks and for the slotted ALOHA communication protocol are discussed. Several of the simulations are implemented and show impressive computational speeds. This paper summarizes previous results of the authors and presents some new experiments and simulations.

著录项

来源
《ACM Transactions on Modeling and Computer Simulation: A Publication of the Association for Computing Machinery》 |1996年第2期|107-136|共30页
作者
Albert G. Greenberg; Boris D. Lubachevsky; Isi Mitrani;
展开▼
作者单位

AT&T Bell Laboratories, Murry Hill, New Jersey;

University of Newcastle, Newcastle upon Tyne, Great Britain;

展开▼
收录信息
原文格式 PDF
正文语种英语
中图分类计算技术、计算机技术;
关键词
Fixed-point computations; massively parallel computations; recurrences; relaxation; superlinear speedup; unbounded parallelism;

Superfast parallel discrete event simulations

摘要

著录项

相关主题

期刊订阅