Dartmouth SSF is developed at Dartmouth College under the supervision of Professor David M. Nicol.

Dartmouth SSF is primarily implemented by Xiaowen (Jason) Liu.

Dartmouth SSF is improved upon the following research products:

• Nops, developed by Anna L. Poplawski and David M. Nicol, is based on a conservative window-based parallel simulation engine. The success of Nops in terms of its performance encouraged us to continue developing DaSSF as a full-fledged high-performance parallel simulator.
• The Cilk Project at MIT. Our handcrafted threading mechanism is learned from Cilk's multi-threading, with two distinct differences. DaSSF's multi-threading is tied with simulation scheduling and time management. Also, DaSSF's source-code translation is based on C++ language, instead of C language.
• Mersenne Twister, by Makoto Matsumoto and Takuji Nishimura. It's a pseudorandom number generator that has a provable period of 2^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.