Abstract: Methods, systems, and apparatuses for scheduling a plurality of Virtual Links (VLs) in a Time-Triggered Ethernet (TTE) network by pre-processing, by a scheduling algorithm implemented by a Network Scheduling Tool (NST), VL information prior to initiating a scheduling procedure by, detecting VL information associated with VLs that having common physical resources that include a common direction of a switching port or an egress end system port; and storing the VL information associated with the set of VLs for retrieval by the NST to parse a VL list for scheduling to determine one or more conflicting VLs in functionalities with a VL that is to be scheduled by a first pass that attempts favoring scheduling a VL into a bin when previously scheduled VLs fail to exhibit conflicts; and a second pass that attempts to resolve at least one conflict exhibited in the scheduling procedure by offsetting a transmit time.

Abstract: Methods, systems, and apparatuses for scheduling a plurality of Virtual Links (VLs) in a Time-Triggered Ethernet (TTE) network by determining a subset of a group of bins allocated to TT traffic; restricting the subset bin groups to a specified harmonic subdivided pattern with a certain duration; allocating the subset of bin groups in accordance with bin group equated with a rate at least twice as high as a highest TT traffic rate available in the network to enable control of partitioned traffic by using a set of media reservations; checking whether a bin selected via a bin selection process for scheduling a TT Virtual Link (VL) is a valid TT bin, else proceeding to a subsequent bin until a valid TT bin is returned for the TT VL, and reserving using at least one media reservation for a TT VL to be scheduled by temporal partitioning at the restricted rate.

Abstract: Methods, systems, and apparatuses for scheduling a plurality of Virtual Links (VLs) in a Time-Triggered Ethernet (TTE) network by determining a subset of a group of bins allocated to TT traffic; restricting the subset bin groups to a specified harmonic subdivided pattern with a certain duration; allocating the subset of bin groups in accordance with bin group equated with a rate at least twice as high as a highest TT traffic rate available in the network to enable control of partitioned traffic by using a set of media reservations; checking whether a bin selected via a bin selection process for scheduling a TT Virtual Link (VL) is a valid TT bin, else proceeding to a subsequent bin until a valid TT bin is returned for the TT VL, and reserving using at least one media reservation for a TT VL to be scheduled by temporal partitioning at the restricted rate.

Abstract: Methods, systems, and apparatuses for scheduling a plurality of Virtual Links (VLs) in a Time-Triggered Ethernet (TTE) network by pre-processing, by a scheduling algorithm implemented by a Network Scheduling Tool (NST), VL information prior to initiating a scheduling procedure by, detecting VL information associated with VLs that having common physical resources that include a common direction of a switching port or an egress end system port; and storing the VL information associated with the set of VLs for retrieval by the NST to parse a VL list for scheduling to determine one or more conflicting VLs in functionalities with a VL that is to be scheduled by a first pass that attempts favoring scheduling a VL into a bin when previously scheduled VLs fail to exhibit conflicts; and a second pass that attempts to resolve at least one conflict exhibited in the scheduling procedure by offsetting a transmit time.

Abstract: Methods, systems, and apparatuses for orchestrating the re-configuration of a Time-Triggered Ethernet (TTE) network for a plurality of configuration definitions (CDs) within a network configuration superset (NCS) by a Network Scheduling Tool (NST), including coupling a plurality of FSs to at least one common control FS (CCFS) to enable control by the NST of each FS by a runtime procedure wherein each FS of the plurality of FSs is composed of Virtual Links (VLs); scheduling the plurality of features sets (FSs) based on a target configuration of a specified FSs coupled to the CCFS within the TTE network; collecting, in a first scheduling pass by the NST, multiple FSs related to a plurality of phase configurations wherein the FSs are used to derive a specified target FS configuration; and forming a common FS by using an application to determine features associated with each FS of the plurality of FSs.

Abstract: Methods, systems, and apparatuses for orchestrating the re-configuration of a Time-Triggered Ethernet (TTE) network for a plurality of configuration definitions (CDs) within a network configuration superset (NCS) by a Network Scheduling Tool (NST), including coupling a plurality of FSs to at least one common control FS (CCFS) to enable control by the NST of each FS by a runtime procedure wherein each FS of the plurality of FSs is composed of Virtual Links (VLs); scheduling the plurality of features sets (FSs) based on a target configuration of a specified FSs coupled to the CCFS within the TTE network; collecting, in a first scheduling pass by the NST, multiple FSs related to a plurality of phase configurations wherein the FSs are used to derive a specified target FS configuration; and forming a common FS by using an application to determine features associated with each FS of the plurality of FSs.

Abstract: Methods, systems and apparatuses for scheduling a plurality of Virtual Links (VLs) in a Time-Triggered Ethernet (TTE) network by a network scheduling and configuration tool (NST) by establishing a collection of bins that corresponds to the smallest harmonic period allowing full network traversal of a time-triggered traffic packet in the network for determining available bin sets for sending the VL data by the NST; processing by a scheduling algorithm the VLs to be sent in accordance with a strict order comprising scheduling all the highest rate VLs prior to scheduling lower rate VLs; and scheduling reservations for the VLs in bins by tracking the available time available in each bin and optionally spreading the VL data across available bin sets by sorting a list of available bins by ascending bin utilization and by specifying a left-to-right or right-to-left sort order when searching for available bins based on a position in the timeline between the transmitter and receiver end stations.

Abstract: Methods, systems and apparatuses for scheduling a plurality of Virtual Links (VLs) in a Time-Triggered Ethernet (TTE) network by a network scheduling and configuration tool (NST) by establishing a collection of bins that corresponds to the smallest harmonic period allowing full network traversal of a time-triggered traffic packet in the network for determining available bin sets for sending the VL data by the NST; processing by a scheduling algorithm the VLs to be sent in accordance with a strict order comprising scheduling all the highest rate VLs prior to scheduling lower rate VLs; and scheduling reservations for the VLs in bins by tracking the available time available in each bin and optionally spreading the VL data across available bin sets by sorting a list of available bins by ascending bin utilization and by specifying a left-to-right or right-to-left sort order when searching for available bins based on a position in the timeline between the transmitter and receiver end stations.

Abstract: An optical data switch for use within a multiprocessing environment is disclosed. Each processor has associated with it a data projector, such as a laser or an array of light emitting diodes, and a reading device, such as a Charge Coupled Device array. An optically reflective screen, or mirror, is arranged so that all processors can project their data on the screen at a specified location. Each processor's reading device has a view of the entire screen, thereby being capable of reading data from any other processor.