公开(公告)号：US10908955B2

公开(公告)日：2021-02-02

申请号：US15928656

申请日：2018-03-22

Applicant: Honeywell International Inc.

Inventor： Srivatsan Varadarajan ,  Larry James Miller ,  Chittaranjan Kashiwar ,  Pavel Zaykov

IPC: G06F9/50 ,  G06F9/54 ,  G06F9/48 ,  G06F13/40

Abstract: A method is provided. The method comprises: commencing a time window, where the time window has a fixed or variable time duration; determining a shared resource access quota for at least one time partition for the time window, where the shared resource access quota may vary by time window; allocating each determined shared resource access quota to a corresponding time partition for the window; determining if allocated shared resource access quota for any time partition in the time window has been met or exceeded; and if an allocated shared resource access quota for a time partition in the time window has been met or exceeded, then halting an executing process in the time partition.

公开(公告)号：US09769075B2

公开(公告)日：2017-09-19

申请号：US14676464

申请日：2015-04-01

Applicant: Honeywell International Inc.

Inventor： Srivatsan Varadarajan ,  Brendan Hall ,  William Todd Smithgall ,  Ted Bonk ,  Benjamin F. DeLay

IPC: H04L12/801 ,  H04L12/40 ,  H04L12/64 ,  H04L12/841 ,  H04L12/863

CPC classification number: H04L47/12 ,  H04L12/4015 ,  H04L12/64 ,  H04L12/6418 ,  H04L47/28 ,  H04L47/50 ,  H04L2012/4028 ,  H04L2012/6451 ,  H04L2012/6454

Abstract: Systems and methods for interference cognizant network scheduling are provided. In certain embodiments, a method of scheduling communications in a network comprises identifying a bin of a global timeline for scheduling an unscheduled virtual link, wherein a bin is a segment of the timeline; identifying a pre-scheduled virtual link in the bin; and determining if the pre-scheduled and unscheduled virtual links share a port. In certain embodiments, if the unscheduled and pre-scheduled virtual links don't share a port, scheduling transmission of the unscheduled virtual link to overlap with the scheduled transmission of the pre-scheduled virtual link; and if the unscheduled and pre-scheduled virtual links share a port: determining a start time delay for the unscheduled virtual link based on the port; and scheduling transmission of the unscheduled virtual link in the bin based on the start time delay to overlap part of the scheduled transmission of the pre-scheduled virtual link.

公开(公告)号：US09612868B2

公开(公告)日：2017-04-04

申请号：US13665294

申请日：2012-10-31

Applicant: Honeywell International Inc.

Inventor： Arvind Easwaran ,  Srivatsan Varadarajan

IPC: G06F9/46 ,  G06F9/455 ,  G06F9/48

CPC classification number: G06F9/4881 ,  G06F9/4887 ,  G06F2209/483

Abstract: Systems and methods for instruction entity allocation and scheduling on multi-processors is provided. In at least one embodiment, a method for generating an execution schedule for a plurality of instruction entities for execution on a plurality of processing units comprises arranging the plurality of instruction entities into a sorted order and allocating instruction entities in the plurality of instruction entities to individual processing units in the plurality of processing units. The method further comprises scheduling instances of the instruction entities in scheduled time windows in the execution schedule, wherein the instances of the instruction entities are scheduled in scheduled time windows according to the sorted order of the plurality of instruction entities and organizing the execution schedule into execution groups.

公开(公告)号：US20210067459A1

公开(公告)日：2021-03-04

申请号：US16554210

申请日：2019-08-28

Applicant: HONEYWELL INTERNATIONAL INC.

Inventor： Benjamin F. DeLay ,  Srivatsan Varadarajan ,  Theodore J. Bonk ,  William T. Smithgall ,  Brent A. Morin

IPC: H04L12/869 ,  H04L12/803 ,  H04L12/935 ,  H04L12/841 ,  H04L12/919

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.

公开(公告)号：US10768984B2

公开(公告)日：2020-09-08

申请号：US14737010

申请日：2015-06-11

Applicant: Honeywell International Inc.

Inventor： Srivatsan Varadarajan ,  Larry James Miller ,  Arthur Kirk McCready ,  Aaron R. Larson ,  Richard Frost ,  Ryan Lawrence Roffelsen

IPC: G06F9/50 ,  G06F9/48

Abstract: Systems and methods for scheduling tasks using sliding time windows are provided. In certain embodiments, a system for scheduling the execution of tasks includes at least one processing unit configured to execute multiple tasks, wherein each task in the multiple tasks is scheduled to execute within a scheduler instance in multiple scheduler instances, each scheduler instance in the multiple scheduler instances being associated with a set of time windows in multiple time windows and with a set of processing units in the at least one processing unit in each time window, time windows in the plurality of time windows having a start time and an allotted duration and the scheduler instance associated with the time windows begins executing associated tasks no earlier than the start time and executes for no longer than the allotted duration, and wherein the start time is slidable to earlier moments in time.

公开(公告)号：US20160294721A1

公开(公告)日：2016-10-06

申请号：US14676474

申请日：2015-04-01

Applicant: Honeywell International Inc.

Inventor： Srivatsan Varadarajan ,  Brendan Hall ,  William Todd Smithgall ,  Ted Bonk ,  Benjamin F. DeLay

IPC: H04L12/863 ,  H04L12/26 ,  H04L12/925

CPC classification number: H04L47/621 ,  H04L41/0869 ,  H04L43/0817 ,  H04L47/722

Abstract: Systems and methods for network bandwidth, buffers and timing management using hybrid scheduling of traffic with different priorities and guarantees are provided. In certain embodiments, a method of managing network scheduling and configuration comprises, for each transmitting end station, reserving one exclusive buffer for each virtual link to be transmitted from the transmitting end station; for each receiving end station, reserving exclusive buffers for each virtual link to be received at the receiving end station; and for each switch, reserving a exclusive buffer for each virtual link to be received at an input port of the switch. The method further comprises determining if each respective transmitting end station, receiving end station, and switch has sufficient capability to support the reserved buffers; and reporting buffer infeasibility if each respective transmitting end station, receiving end station, and switch does not have sufficient capability to support the reserved buffers.

Abstract translation: 提供了使用具有不同优先级和保证的流量的混合调度的网络带宽，缓冲器和定时管理的系统和方法。 在某些实施例中，管理网络调度和配置的方法包括：对于每个发送端站，为从发送端站发送的每个虚拟链路预留一个专用缓冲器; 为每个接收端站预留在接收端站处要接收的每个虚拟链路的排他缓冲器; 并且对于每个交换机，为在交换机的输入端口处接收的每个虚拟链路预留专用缓冲器。 该方法还包括确定每个相应的发送端站，接收端站和交换机是否具有足够的能力来支持所保留的缓冲器; 并且如果每个相应的发送终端站，接收终端站和交换机不具有足够的能力来支持所保留的缓冲器，则报告缓冲区不可行性。

公开(公告)号：US20140122848A1

公开(公告)日：2014-05-01

申请号：US13665294

申请日：2012-10-31

Applicant: HONEYWELL INTERNATIONAL INC.

Inventor： Arvind Easwaran ,  Srivatsan Varadarajan

IPC: G06F9/30 ,  G06F9/38

CPC classification number: G06F9/4881 ,  G06F9/4887 ,  G06F2209/483

Abstract: Systems and methods for instruction entity allocation and scheduling on multi-processors is provided. In at least one embodiment, a method for generating an execution schedule for a plurality of instruction entities for execution on a plurality of processing units comprises arranging the plurality of instruction entities into a sorted order and allocating instruction entities in the plurality of instruction entities to individual processing units in the plurality of processing units. The method further comprises scheduling instances of the instruction entities in scheduled time windows in the execution schedule, wherein the instances of the instruction entities are scheduled in scheduled time windows according to the sorted order of the plurality of instruction entities and organizing the execution schedule into execution groups.

Abstract translation: 提供了多处理器上指令实体分配和调度的系统和方法。 在至少一个实施例中，一种用于生成多个指令实体用于在多个处理单元上执行的执行调度的方法包括：将多个指令实体排列成排序顺序，并将多个指令实体中的指令实体分配给个体 多个处理单元中的处理单元。 该方法还包括在执行调度中的调度时间窗口中调度指令实体的实例，其中根据多个指令实体的排序顺序在指令实体中调度指令实体的实例并将执行调度组织到执行中 团体

公开(公告)号：US11552857B2

公开(公告)日：2023-01-10

申请号：US16554280

申请日：2019-08-28

Applicant: HONEYWELL INTERNATIONAL INC.

Inventor： Benjamin F. DeLay ,  Srivatsan Varadarajan

IPC: H04L41/16 ,  G06N3/08 ,  G06N3/04 ,  H04L41/0893 ,  H04L49/25

Abstract: Methods, systems and apparatuses to enable an optimum bin selection by implementing a neural network with a network scheduling and configuration tool (NST), the method includes: configuring an agent with a critic function from neural networks wherein the agent neural network represents each bin of the collection of bins in the network that performs an action, and a critic function evaluates a criteria of success for performing the action; processing, by a scheduling algorithm, the VLs by the NST; determining one or more reward functions using global quality measurements based on criteria comprising: a lack of available bins, a lack of available VLs, and successfully scheduling operations of a VL into a bin; and training the network based on a normalized state model of the scheduled network by using input data sets to arrive at an optimum bin selection.

公开(公告)号：US20210067417A1

公开(公告)日：2021-03-04

申请号：US16554280

申请日：2019-08-28

Applicant: HONEYWELL INTERNATIONAL INC.

Inventor： Benjamin F. DeLay ,  Srivatsan Varadarajan

IPC: H04L12/24 ,  G06N3/04 ,  G06N3/08

Abstract: Methods, systems and apparatuses to enable an optimum bin selection by implementing a neural network with a network scheduling and configuration tool (NST), the method includes: configuring an agent with a critic function from neural networks wherein the agent neural network represents each bin of the collection of bins in the network that performs an action, and a critic function evaluates a criteria of success for performing the action; processing, by a scheduling algorithm, the VLs by the NST; determining one or more reward functions using global quality measurements based on criteria comprising: a lack of available bins, a lack of available VLs, and successfully scheduling operations of a VL into a bin; and training the network based on a normalized state model of the scheduled network by using input data sets to arrive at an optimum bin selection.

公开(公告)号：US10917355B1

公开(公告)日：2021-02-09

申请号：US16554210

申请日：2019-08-28

Applicant: HONEYWELL INTERNATIONAL INC.

Inventor： Benjamin F. DeLay ,  Srivatsan Varadarajan ,  Theodore J. Bonk ,  William T. Smithgall ,  Brent A. Morin

IPC: H04L12/869 ,  H04L12/803 ,  H04L12/919 ,  H04L12/841 ,  H04L12/935

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.