Sciweavers

Share
PADS
1999
ACM

Scheduling Critical Channels in Conservative Parallel Discrete Event Simulation

8 years 11 months ago
Scheduling Critical Channels in Conservative Parallel Discrete Event Simulation
This paper introduces the Critical Channel Traversing (CCTJ algorithm, a new scheduling algorithm for both sequential and parallel discrete event simulation. CCT is a general conservative algorithm that is aimed at the simulation of low-granularity network models on shared-memory multi-procrssor computers. An implementation ofihe CCTalgorithm within a kernel called TasKit has demonstrated excellent performance for large ATM network simulations when compared topreviorrs sequential. optimistic and conservative kernels. TasKit has achieved two to three times speedup on a single processor with respect to a splay tree central-event-list based sequential kernel. On a 16 processor (RSOOO) Silicon Graphics
Xiao Zhonge, Brian Unger, Rob Simmonds, John G. Cl
Added 03 Aug 2010
Updated 03 Aug 2010
Type Conference
Year 1999
Where PADS
Authors Xiao Zhonge, Brian Unger, Rob Simmonds, John G. Cleary
Comments (0)
books