Sciweavers

94 search results - page 8 / 10
» On simulation model complexity
Sort
View
162 views 110 votes 15 years 5 months ago  PADS 1996»
Advances in massively parallel platforms are increasing the prospects for high performance discrete event simulation. Still the di culty in parallel programming persists and there...
134 views 130 votes 15 years 6 months ago  PADS 2004»
We investigated the benefit of exploiting the symmetries of graphs for partitioning. We represent the model to be simulated by a weighted graph. Graph symmetries are studied in th...
102 views 102 votes 15 years 7 months ago  PADS 2005»
The use of software diversity has often been discussed in the research literature as an effective means to break up the software monoculture present on the Internet and to thus p...
98 views 79 votes 15 years 5 months ago  PADS 1999»
This year’s installment of the PADS “community assessment” looks at previous assessments and considers some current directions in distributed simulation and their possible r...
83 views 91 votes 15 years 6 months ago  PADS 2003»
Packet-level discrete-event network simulators use an event to model the movement of each packet in the network. This results in accurate models, but requires that many events are...
175 views 158 votes 15 years 5 months ago  PADS 1999»
We have developed a set of performance prediction tools which help to estimate the achievable speedups from parallelizing a sequential simulation. The tools focus on two important...
162 views 97 votes 15 years 6 months ago  PADS 2004»
Parallel discrete event simulation techniques have enabled the realization of large-scale models of communication networks containing millions of end hosts and routers. However, t...
79 views 87 votes 15 years 5 months ago  PADS 1997»
Multi-resolution representation of simulated entities is considered essentialfor a growing portion of distributed simulations. Heretofore,modelers have representedentites at just ...
143 views 86 votes 15 years 7 months ago  PADS 2005»
The RINSE simulator is being developed to support large-scale network security preparedness and training exercises, involving hundreds of players and a modeled network composed of...
113 views 101 votes 15 years 5 months ago  PADS 1999»
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 cons...