Computer resource management for competing processes

Details Computer resource management for competing processes Computer resource management for competing processes

2006-04-25

2006-04-25

An, Meng-Ai (Department: 2195)

Electrical computers and digital processing systems: virtual mac

Task management or control

Process scheduling

C718S100000

Reexamination Certificate

active

07036124

ABSTRACT:
Resource management for controlling allocation of a resource to competing computer processes is achieved through the use of a joining function. A resource manager is responsive to identification of a thread for a first process requesting allocation of the resource, when the resource is already allocated to a thread for a second process, to establish a joining function to the thread for the second process. The joining function is operable to notify the resource manager on termination of the thread for the second process. The resource manager can therefore be operable in response to termination of the thread for the second process to allocate the resource to the first process. The first and second processes can be call handling processes for telecommunications apparatus where the resource manager provides allocation of a telephony resource, such as a modem or network interface, to the competing call handling applications. A telephony interface and the applications can be implemented in the Java™ language.

REFERENCES:
patent: 3579207 (1971-05-01), Barlett et al.
patent: 4420909 (1983-12-01), Steere, Jr.
patent: 4665484 (1987-05-01), Nanba
patent: 5060150 (1991-10-01), Simor
patent: 5115499 (1992-05-01), Stiffler et al.
patent: 5193110 (1993-03-01), Jones et al.
patent: 5233533 (1993-08-01), Edstrom et al.
patent: 5408663 (1995-04-01), Miller
patent: 5420909 (1995-05-01), Ng et al.
patent: 5423066 (1995-06-01), Sasuta
patent: 5649113 (1997-07-01), Zhu et al.
patent: 5652789 (1997-07-01), Miner
patent: 5666532 (1997-09-01), Saks et al.
patent: 5706516 (1998-01-01), Chang et al.
patent: 5715457 (1998-02-01), Wakatani
patent: 5926635 (1999-07-01), Hsueh et al.
patent: 5978832 (1999-11-01), Sirkin
patent: 6026158 (2000-02-01), Bayless et al.
patent: 6035277 (2000-03-01), Anbil et al.
patent: 6052695 (2000-04-01), Abe et al.
patent: 6070142 (2000-05-01), McDonough et al.
patent: 6085198 (2000-07-01), Skinner et al.
patent: H1894 (2000-10-01), Fletcher et al.
patent: H1896 (2000-10-01), Hoffpauir et al.
patent: H1918 (2000-11-01), Hoffpauir et al.
patent: 6195676 (2001-02-01), Spix et al.
patent: H1964 (2001-06-01), Hoffpauir et al.
patent: 6272531 (2001-08-01), Shrader
patent: 6275843 (2001-08-01), Chorn
patent: 6314446 (2001-11-01), Stiles
patent: 6381321 (2002-04-01), Brown et al.
patent: 6385638 (2002-05-01), Baker-Harvey
patent: 6411983 (2002-06-01), Gallop
patent: 6504913 (2003-01-01), Patterson
patent: 6570972 (2003-05-01), Patterson
patent: 0 537 509 (1993-04-01), None
patent: 0 657 809 (1995-06-01), None
patent: 0 817 041 (1998-01-01), None
patent: 0 817 041 (1998-01-01), None
patent: 964332 (1999-12-01), None

Affiliated with

Also associated with

Rating

Computer resource management for competing processes does not yet have a rating. At this time, there are no reviews or comments for this patent.

If you have personal experience with Computer resource management for competing processes, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Computer resource management for competing processes will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFUS-PAI-O-3525292