ROSS
ross.h
Go to the documentation of this file.
1#ifndef INC_ross_h
2#define INC_ross_h
3
4/** @mainpage Rensselaer's Optimistic Simulation System (ROSS)
5 @section intro_sec Introduction
6
7 ROSS is an acronym for Rensselaer's Optimistic Simulation System. It is a
8 parallel discrete-event simulator that executes on shared-memory
9 multiprocessor systems. ROSS is geared for running large-scale simulation
10 models (i.e., 100K to even 1 million object models). The synchronization
11 mechanism is based on Time Warp. Time Warp is an optimistic
12 synchronization mechanism develop by Jefferson and Sowizral [10, 11] used
13 in the parallelization of discrete-event simulation. The distributed
14 simulator consists of a collection of logical processes or LPs, each
15 modeling a distinct component of the system being modeled, e.g., a server
16 in a queuing network. LPs communicate by exchanging timestamped event
17 messages, e.g., denoting the arrival of a new job at that server.
18
19 The Time Warp mechanism uses a detection-and-recovery protocol to
20 synchronize the computation. Any time an LP determines that it has
21 processed events out of timestamp order, it "rolls back" those events, and
22 re-executes them. For a detailed discussion of Time Warp as well as other
23 parallel simulation protocols we refer the reader to [8]
24
25 ROSS was modeled after a Time Warp simulator called GTW or Georgia Tech
26 Time Warp[7]. ROSS helped to demonstrate that Time Warp simulators can be
27 run efficiently both in terms of speed and memory usage relative to a
28 high-performance sequential simulator.
29
30 To achieve high parallel performance, ROSS uses a technique call Reverse
31 Computation. Here, the roll back mechanism in the optimistic simulator is
32 realized not by classic state-saving, but by literally allowing to the
33 greatest possible extent events to be reverse. Thus, as models are
34 developed for parallel execution, both the forward and reverse execution
35 code must be written. Currently, both are done by hand. We are
36 investigating automatic methods that are able to generate the reverse
37 execution code using only the forward execution code as input. For more
38 information on ROSS and Reverse Computation we refer the interested reader
39 to [4, 5]. Both of these text are provided as additional reading in the
40 ROSS distribution.
41
42@section license_sec License
43Copyright (c) 2013, Rensselaer Polytechnic Institute
44All rights reserved.
45
46Redistribution and use in source and binary forms, with or without
47modification, are permitted provided that the following conditions are
48met:
49
50 Redistributions of source code must retain the above copyright
51 notice, this list of conditions and the following disclaimer.
52
53 Redistributions in binary form must reproduce the above copyright
54 notice, this list of conditions and the following disclaimer in the
55 documentation and/or other materials provided with the distribution.
56
57 Neither the name of Rensselaer Polytechnic Institute nor the names
58 of its contributors may be used to endorse or promote products
59 derived from this software without specific prior written
60 permission.
61
62THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
63"AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
64LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
65A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT
66HOLDER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
67SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT
68LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
69DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
70THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
71(INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
72OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
73
74*/
75
76/*******************************************************************
77 * The location of this include is important, as it is outside of *
78 * the __cplusplus check. This is required as the mpi header will *
79 * mess up and complain if we force it into an extern "C" context. *
80 *******************************************************************/
81#include <mpi.h>
82
83#ifdef __cplusplus
84extern "C" {
85#endif
86
87/*********************************************************************
88 *
89 * Include ``standard'' headers that most of ROSS will require.
90 *
91 ********************************************************************/
92
93#include <errno.h>
94#include <limits.h>
95#include <stdlib.h>
96#include <unistd.h>
97#include <stdarg.h>
98
99#ifdef USE_BGPM
100#include<bgpm.h>
101#endif
102
103#include "ross-base.h"
104#include "ross-clock.h"
105#include "ross-gvt.h"
106#include "ross-inline.h"
107#include "ross-kernel-inline.h"
108#include "ross-types.h"
109#include "ross-extern.h"
110#include "ross-random.h"
111
114
115// Optional headers not needed by any other headers (above)
116#ifdef USE_DAMARIS
117#include "damaris/core/damaris.h"
118#endif
119
120
121#ifdef __cplusplus
122}
123#endif
124
125#endif
Definition of ROSS basic types.