|








|
|

| Scalable Simulation Framework |
- SSF Research Network

Dartmouth SSF is an active participant of SSF
Research Network (SSFNET), an open consortium of SSF users whose
goal is to develop and validate SSF-based modeling strategies, and
to exchange SSF network models. This site contains a collection of
SSF-based models for simulating Internet protocols and
networks.
- Scalable
Self-Organizing Simulations (S3) at DIMACS, Rutgers University.

Dartmouth SSF is part of project S3, whose goal is to
achieve radical improvements in simulations of very large scale
communications networks, with collaboration of researchers in
networking and parallel simulations.
- Parallel
JTeD Homepage at Dartmouth
College.

Java SSF stands for Java implementation of Scalable
Simulation Framework. Java SSF provides the primary reference
implementation of SSF and serves as a platform for development of its
most advanced features. The potential for network-wide distributed Java
simulations is discussed here.
- JSSF at
Cooperating Systems
Corporation.

JSSF from Cooperating Systems provides the reference
implementation of the Java SSF API. JSSF is a pure Java code that
runs on anything. With JDK1.2 it provides respectably fast parallel
execution on multiprocessor SUN Solaris. The site also contains
extensive documentations on SSF.
- SSF
Implementation of BGP-4, maintained by Brian J. Premore.

This is an SSF implementation of simulating Border
Gateway Protocol, developed as part of SSFNET.
- TeD -
Telecommunications Description Language at Georgia Tech is a
language that has been developed mainly for modeling
telecommunication network elements and protocols. TeD is developed
on top of Georgia Tech Time Warp kernel.
- Parallel and
Distributed Simulation (PADS), maintained by Samir
R. Das. This site contains comprehensive links to researchers and
projects in PADS community.
- The Cilk Project at
MIT is a language for
multi-threaded parallel programming based on ANSI C. Dartmouth SSF's
multi-threading scheme is coined by Cilk with significant extensions
to parallel simulation and C++.
- Mersenne
Twister is a pseudorandom number generator that
has a provable period of ^19937-1 and 623-dimensional
equidistribution property, according to its creator.
-
Metis from University of
Minnesota. Metis is a graph partitioning tool,
which is modified and used by us to partition DaSSF simulation
models.
- Hoard
from University of Texas at
Austin. Hoard is a scalable memory allocator for
multithreaded applications. Hoard is incorporated in DaSSF for
parallel memory management support.
- Doug Lea's
memory allocator is used either directly in DaSSF
or as the backend of Hoard.

|
 |