Honeywell International Inc.

Honeywell G.m.b.h.

Stephen C Vestal

Pamela A Binns

Aaron Raymond Larson

Ryan Lawrence Roffelsen

Murali Rangarajan

One example is directed to a method of generating a set of schedules for use by a partitioning kernel to execute a plurality of partitions on a plurality of processor cores included in a multi-core processor unit. The method includes determining a duration to execute each of the plurality of partitions without interference and generating a candidate set of schedules using the respective duration for each of the plurality of partitions. The method further includes estimating how much interference occurs for each partition when the partitions are executed on the multi-core processor unit using the candidate set of schedules and generating a final set of schedules by, for at least one of the partitions, scaling the respective duration in order to account for the interference for that partition. The method further includes configuring the multi-core processor unit to use the final set of schedules to control the execution of the partitions using at least two of the cores.

Safe partition scheduling on multi-core processors

A method and system for increasing the precision of time synchronization among a plurality of host nodes in a packet-switched network by reducing transmission delay variation in the network. Each host node is provided with a distinct set of transmission times selected from a global schedule in such a way as to avoid concurrent transmission of messages by the plurality of host nodes. The transmission times may be determined as offsets within a global hyperperiod, and each host node carries out transmissions according to predetermine offsets the respective host node. Transmissions according to offsets may be applied to real-time messages, including time-synchronization messages, hence yielding increase precision of synchronization.

Method and system for achieving low jitter in real-time switched networks

A method for scheduling one or more data packet transfers over a computer-based distributed network is disclosed. The method involves constructing a cyclic schedule from a plurality of data packets, wherein the cyclic schedule is constructed to ensure that each data packet transfer is substantially free of jitter. The method further involves synchronizing the cyclic schedule with at least one periodic processing schedule and transmitting the synchronized data packets as arranged by the cyclic schedule.

End system scheduling for switched networks

Methods for modeling real-time periodic and aperiodic task scheduling and message passing within multitask systems. The methods utilize undelayed and single sample delayed message connections among software task objects and hardware objects. Task priorities are assigned inversely with period or deadline, so that tasks with shorter periods or deadlines have higher scheduling priorities. Periods of high-criticality tasks are decomposed into smaller pieces that are sequentially dispatched at higher rates where the initial assignment of priority is inconsistent with task criticality. The methods provide for deterministic communication among periodic processes.

Growing community of inventors

North Oaks, MN, United States of America

Stephen C Vestal