Multithreading with concurrency domains

Electrical computers and digital processing systems: interprogra – Interprogram communication using message – Message using queue

Reexamination Certificate

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

C719S313000

Reexamination Certificate

active

07581225

ABSTRACT:
Methods, systems and computer products are provided for partitioning software application components into separate domains called concurrency domains. Computationally expensive, slow or long-running methods may be deployed into such domains, thus keeping the associated application more responsive to the end user. According to one aspect of the invention, a given concurrency domain is a partition of runtime objects for providing synchronization and thread isolation within the partition and for providing concurrency with other such partitions in a data-driven dynamically composed and reconfigured application.

REFERENCES:
patent: 5659701 (1997-08-01), Amit et al.
patent: 5940828 (1999-08-01), Anaya et al.
patent: 6083276 (2000-07-01), Davidson et al.
patent: 6205465 (2001-03-01), Schoening et al.
patent: 6256780 (2001-07-01), Williams et al.
patent: 6339775 (2002-01-01), Zamanian et al.
patent: 6670969 (2003-12-01), Halstead et al.
patent: 6721951 (2004-04-01), Williams et al.
patent: 6820135 (2004-11-01), Dingman et al.
patent: 6823518 (2004-11-01), Bliss et al.
patent: 7032210 (2006-04-01), Alloing et al.
patent: 7043481 (2006-05-01), Mullins et al.
patent: 7233982 (2007-06-01), Shenefiel
patent: 7280996 (2007-10-01), Hayakawa et al.
patent: 7287259 (2007-10-01), Grier et al.
patent: 7383285 (2008-06-01), Pal et al.
patent: 2002/0065950 (2002-05-01), Katz et al.
patent: 2002/0069401 (2002-06-01), Wall et al.
patent: 2003/0135825 (2003-07-01), Gertner et al.
patent: 2003/0192031 (2003-10-01), Srinivasan et al.
patent: 2004/0031018 (2004-02-01), Marty
patent: 2004/0083238 (2004-04-01), Louis et al.
patent: 2004/0083455 (2004-04-01), Gschwind et al.
patent: 2004/0181779 (2004-09-01), Gorti
patent: 2004/0230666 (2004-11-01), Taboada et al.
patent: 2005/0044235 (2005-02-01), Balahura et al.
patent: 2005/0120275 (2005-06-01), Fletcher et al.
patent: 2005/0135383 (2005-06-01), Shenefiel
patent: 2006/0245096 (2006-11-01), Ahmad et al.
patent: 2006/0248104 (2006-11-01), Ahmad et al.
patent: 2006/0248112 (2006-11-01), Williams et al.
patent: 2006/0248448 (2006-11-01), Williams et al.
patent: 2006/0248449 (2006-11-01), Williams et al.
patent: 2006/0248450 (2006-11-01), Wittenberg et al.
patent: 2006/0248451 (2006-11-01), Szyperski et al.
patent: 2006/0277201 (2006-12-01), Dorsett
patent: 2008/0046885 (2008-02-01), Shultz et al.
patent: 2008/0263549 (2008-10-01), Walker
International Search Report dated Apr. 26, 2007 cited in International Application No. PCT/US 06/15184.
U.S. Office Action dated Feb. 4, 2008 cited in U.S. Appl. No. 11/360,456.
U.S. Office Action dated Mar. 27, 2008 cited in U.S. Appl. No. 11/360,454.
Chamberlain et al., “Quilt: An XML Query Language for Heterogeneous Data Sources,” 2001, Springer Verlag Berlin Heidelberg, pp. 1-25.
U.S. Office Action dated Jun. 23, 2008 cited in U.S. Appl. No. 11/360,856.
U.S. Final Office Action dated Nov. 7, 2008 cited in U.S. Appl. No. 11/360,456.
Chinese Office Action dated Oct. 10, 2008 in Application No. 200680014637.X.
U.S. Office Action dated May 22, 2009 cited in U.S. Appl. No. 11/360,456.

LandOfFree

Say what you really think

Search LandOfFree.com for the USA inventors and patents. Rate them and share your experience with other people.

Rating

Multithreading with concurrency domains does not yet have a rating. At this time, there are no reviews or comments for this patent.

If you have personal experience with Multithreading with concurrency domains, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Multithreading with concurrency domains will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFUS-PAI-O-4082262

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.