Parallel simulation by multi-instruction, longest-path algorithms

DOI10.1023/A:1019149712019MaRDI QIDQ1383326zbMATH OpenOpenAlexFDO

Authors Liang Chen

Publication date 13 April 1998

Published in Queueing Systems (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1023/a:1019149712019

zbMATH Keywords

simulationqueueing networkslongest pathscalable algorithm\(G/G/1\) queuemassive parallel processingMIMD and SIMD parallel computers

Mathematics Subject Classification ID

Queues and service in operations research (90B22) Queueing theory (aspects of probability theory) (60K25)

Recommendations

• ON SIMULATING A CLASS OF PARALLEL ARCHITECTURES
• Practical considerations of parallel simulations and architecture independent parallel algorithm design
• Parallel simulation on the hypercube multiprocessor
• Sequential simulation of parallel iterations and applications
• scientific article; zbMATH DE number 3868619
• Efficient Simulations among Several Models of Parallel Computers

Cited in

(6)

• A PARALLEL DEMAND-DRIVEN SIMULATION ALGORITHM FOR SIMD COMPUTERS
• Parallel simulation of transfer lines by time segmentation
• Long-time simulations with complex code using multiple nodes of Intel Xeon Phi knights landing
• Efficiency of Time Segmentation Parallel Simulation of Finite Markovian Queueing Networks
• scientific article; zbMATH DE number 4074440 (Why is no real title available?)
• Sequential simulation of parallel iterations and applications

This page was built for publication: Parallel simulation by multi-instruction, longest-path algorithms

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1383326)