Efficient event completion in UDAPL

Details Efficient event completion in UDAPL Efficient event completion in UDAPL

2006-03-31

2009-08-18

Meky, Moustafa M (Department: 2453)

Electrical computers and digital processing systems: multicomput

Computer conferencing

Priority based messaging

C711S101000

Reexamination Certificate

active

07577712

ABSTRACT:
A technique in accordance with one embodiment of the invention uses an adaptive algorithm to obtain UDAPL event messages. According to one aspect, a process repetitively performs the following steps as long as the process expects to receive at least one event message. By polling the event message queue at least once, the process determines whether the queue is empty. If the queue is empty, then the process blocks until specified criteria have been satisfied. Alternatively, if the queue is not empty, the process reads an event message from the queue. After the process has either read an event message from the event message queue or finished blocking, the foregoing steps are repeated if the process still expects to receive at least one more event message. According to one aspect, when the process blocks, the process blocks only until a specified number of event messages have arrived in the queue.

REFERENCES:
patent: 7065556 (2006-06-01), Hickey et al.
patent: 2002/0026502 (2002-02-01), Phillips et al.
patent: 2005/0289557 (2005-12-01), Supalov
Dat Collaborative, “uDAPL: User Direct Access Programming Library,” Version:1.2, Dated Sep. 15, 2004, pp. 1-350.

Affiliated with

Also associated with

Rating

Efficient event completion in UDAPL does not yet have a rating. At this time, there are no reviews or comments for this patent.

If you have personal experience with Efficient event completion in UDAPL, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Efficient event completion in UDAPL will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFUS-PAI-O-4126190