Method for synchronizing the dispatching of tasks among multitasking operating systems

Claim 5

The method according to claim 2, wherein after a service request named in a thread has been executed, removing said service request from the thread.

Claim 6

The method according to claim 2, wherein said method comprises the further steps of: (d) ascertaining the presence of an additional service request in the first bound thread, and enqueuing the thread against the resource counterpart to said additional service request, if the additional service request is present; and (e) ascertaining whether said first bound thread is the first in the resource queue, and, if first, causing said first bound thread to become the resource owner, and causing said additional service request to be executed by the current task without having to be enqueued against OS tasks, whereby a single thread opportunistically passes through the communications layers using the same task in the absence of contention within the subsystem.

Claim 7

The method according to claim 4, wherein if the first bound thread was not first enqueued against the resource, then said method comprises the further steps of: (f) causing the task to stop processing said first bound thread and to obtain another thread to process from those threads enqueued against the tasks; and (g) enqueuing the now abandoned first bound thread against a resource counterpart to another service request, if present, in said first bound thread.

Claim 8

The method according to claim 2, wherein the resources are tie groups.

Claim 9

A computer-implemented method for allocating tasks in a multitasking layered communications subsystem as a function of service request (work) distribution, each layer providing a unique set of functions for establishing an association between counterpart connection endpoints, each layer being manifest by at least one control block, each control block being a state representation of the connection endpoints in that layer, each control block further including indicia of a request to provide service, a thread being denominated as a sequence of related service requests performed in a synchronous manner, each service request being associated with counterpart control blocks, each control block further being split within a layer such that it depicts the adjacent layers to a connection within any given layer, each layer including at least one tie, each tie being the connection relation between split portions of the control block in the same layer, a tie group being an undirected graph of ties, only one thread executing per tie group at a time, comprising the steps of: (a) starting a thread responsive to each communication subsystem-oriented command generated by a host-based application, and either binding the thread to an available counterpart tie group and appending said started thread to a queue of available threads, or enqueuing the thread to the counterpart tie group; (b) binding the next available task to the first thread in the queue of available threads provided that there is no other thread with a service request to a control block in the same tie group already bound to any task; and (c) in the event that the first available thread violates the constraint of there being only one bound thread per tie group, binding of a second available thread in the same tie group only after the first thread becomes free.

Claim 10

A computer-implemented method for allocating tasks in a multitasking layered communications subsystem as a function of service request (work) distribution, each layer providing a unique set of functions for establishing an association between counterpart connection endpoints, each layer being manifest by at least one control block, each control block being a state representation of the connection endpoints in that layer, each control block further including indicia of a request to provide service, a thread being denominated as a sequence of related service requests performed in a synchronous manner, each service request being associated with counterpart control blocks, each control block further being split within a layer such that it depicts the adjacent layers to a connection within any given layer, each layer including at least one tie, each tie being the connection relation between split portions of the control block in the same layer, a tie group being an undirected graph of ties, only one thread executing per tie group at a time, comprising the steps of: (a) starting a thread responsive to each communication subsystem-oriented command generated by a host-based application, and either binding the thread to an available counterpart tie group and appending said started thread to a queue of available threads, or enqueuing the thread to the counterpart tie group; (b) binding the next available task to the first thread in the queue of available threads provided that there is no other thread with a service request to a control block in the same tie group already bound to any task; and (c) in the event that the first available thread violates the constraint of there being only one bound thread per tie group, binding of a second available thread in the same tie group only after the first thread becomes free.