<commit_before>#ifndef INC_ross_h
#define INC_ross_h

/** @mainpage Rensselaer’s Optimistic Simulation System (ROSS)
    @section intro_sec Introduction
    
    ROSS is an acronym for Rensselaer’s Optimistic Simulation System. It is a parallel
    discrete-event simulator that executes on shared-memory multiprocessor systems. ROSS 
    is geared for running large-scale simulation models (i.e., 100K to even 1 million object models).
    The synchronization mechanism is based on Time Warp. Time Warp is an optimistic syn- chronization 
    mechanism develop by Jefferson and Sowizral [10, 11] used in the parallelization of discrete-event 
    simulation. The distributed simulator consists of a collection of logical processes or LPs, each 
    modeling a distinct component of the system being modeled, e.g., a server in a queuing network. LPs 
    communicate by exchanging timestamped event messages, e.g., denoting the arrival of a new job at that server.

    The Time Warp mechanism uses a detection-and-recovery protocol to synchronize the computation. Any 
    time an LP determines that it has processed events out of timestamp order, it “rolls back” those events,
    and re-executes them. For a detailed discussion of Time Warp as well as other parallel simulation protocols 
    we refer the reader to [8]

    ROSS was modeled after a Time Warp simulator called GTW or Georgia Tech Time Warp[7]. ROSS helped to demonstrate 
    that Time Warp simulators can be run efficiently both in terms of speed and memory usage relative to a high-performance 
    sequential simulator.

    To achieve high parallel performance, ROSS uses a technique call Reverse Computation. Here, the roll back<commit_msg>Fixed some weird unicode garbage.<commit_after>#ifndef INC_ross_h
#define INC_ross_h

/** @mainpage Rensselaer's Optimistic Simulation System (ROSS)
    @section intro_sec Introduction
    
    ROSS is an acronym for Rensselaer's Optimistic Simulation System. It is a parallel
    discrete-event simulator that executes on shared-memory multiprocessor systems. ROSS 
    is geared for running large-scale simulation models (i.e., 100K to even 1 million object models).
    The synchronization mechanism is based on Time Warp. Time Warp is an optimistic synchronization 
    mechanism develop by <NAME> Sowizral [10, 11] used in the parallelization of discrete-event 
    simulation. The distributed simulator consists of a collection of logical processes or LPs, each 
    modeling a distinct component of the system being modeled, e.g., a server in a queuing network. LPs 
    communicate by exchanging timestamped event messages, e.g., denoting the arrival of a new job at that server.

    The Time Warp mechanism uses a detection-and-recovery protocol to synchronize the computation. Any 
    time an LP determines that it has processed events out of timestamp order, it "rolls back" those events,
    and re-executes them. For a detailed discussion of Time Warp as well as other parallel simulation protocols 
    we refer the reader to [8]

    ROSS was modeled after a Time Warp simulator called GTW or Georgia Tech Time Warp[7]. ROSS helped to demonstrate 
    that Time Warp simulators can be run efficiently both in terms of speed and memory usage relative to a high-performance 
    sequential simulator.

    To achieve high parallel performance, ROSS uses a technique call Reverse Computation. Here, the roll back
{'fraction_non_alphanumeric': 0.036617262423714034, 'fraction_numerical': 0.005812263876780006, 'mean_word_length': 3.8684582743988685, 'pattern_counts': {'":': 0, '<': 4, '<?xml version=': 0, '>': 4, 'https://': 0, 'lorem ipsum': 0, 'www.': 0, 'xml': 0}, 'pii_count': 0, 'substrings_counts': 0, 'word_list_counts': {'cursed_substrings.json': 0, 'profanity_word_list.json': 0, 'sexual_word_list.json': 0, 'zh_pornsignals.json': 0}}
{'dir': 'git-commits-cleaned', 'id': '4372611', 'n_tokens_mistral': 895, 'n_tokens_neox': 834, 'n_words': 477}