Electrical computers and digital processing systems: multicomput – Computer-to-computer data routing – Least weight routing
Patent
1997-12-31
2000-07-04
Banankhah, Majid A.
Electrical computers and digital processing systems: multicomput
Computer-to-computer data routing
Least weight routing
709102, G06F 900
Patent
active
06085216&
ABSTRACT:
A resource allocation method and system allocates a computational resource between elements of a portfolio of computational entities. The computational resource can be processing time, memory or display screen space. The computational resource can also be associated with a distributed network such as the Internet. In this case, the computational resource is the number of pending messages sent across the distributed network, pendancy time of a message sent across the distributed network, priority of the messages sent across the distributed network, and/or cost of the messages set across the distributed network. When the computational resource is processing time, the resource is allocated between different processes executing on the processor. These different processes include different solution procedures for solving a computationally hard problem, different instances of a single solution procedure for solving the computationally hard problem, and the like. The resource is allocated to optimize the solution time or variance in the solution time. When the computational resource is memory, the resource is allocated between files that are to be stored in the memory, where the total size of the files exceeds the available space in the memory. The available space in the memory is allocated to maximize the likelihood that a file will be stored in the memory when it is needed. When the computational resource is screen real estate, the resource is allocated between display icons that are to be displayed on the display screen, where the total area consumed by the icons exceeds the available screen real estate.
REFERENCES:
patent: 5148365 (1992-09-01), Dembo
patent: 5235508 (1993-08-01), Lirov et al.
patent: 5404516 (1995-04-01), Georgiades et al.
patent: 5406476 (1995-04-01), Deziel, Jr. et al.
patent: 5799287 (1998-08-01), Dembo
patent: 5872918 (1999-02-01), Malomsoky et al.
"Hedging Bets on Hard Problems", by Charles Seife, Science, vol. 275, p. 33, Jan. 3, 1997.
"An Economics Approach to Hard Computational Problems", Benardo A. Huberman et al., Science, vol. 275, pp. 51-54, Jan. 3, 1997.
Physical Mapping of Chromosomes "Physical Mapping of chromosomes Using Unique Probes" Faird Alizadeh et al., Chapter 54, pp. 489-500.
"Random Competition: A Simple, but Efficient Method for Parallelizing Inference Systems", Wolfgang Ertel, Parallelization in Inference Systems, B. Fronhofer et al., Eds. pp. 195-207, 1992.
"Minimizing conflicts: a heuristic repair method for constraint satisfaction and scheduling problems", Steven Minton et al. Artificial Intelligence, vol. 58, pp. 161-205 (1992).
"A New Method for Solving Hard Satisfiability Problems", Problem Solving: Constraint Satisfaction, Selman et al. pp. 440-446.
"Phase transitions and the search problem", Hogg et al. Artificial Intelligence vol. 81, (1996), pp. 1-15.
"Critical Behavior in the Satisfiability of Random Boolean Expressions," Scott Kirkpatrick et al. Science vol. 264, pp. 1297-1301 (May 27, 1994).
"Expected Gains from Parallelizing Constraint Solving for Hard Problems" Tad Hogg et al., Proceedings of the 12.sup.th National Conference on Artificial Intelligence, pp. 331-336, 1994.
"Cooperative Solution of Constraint Satisfaction Problems", Scott H. Clearwater et al., Science, vol. 254, pp. 1181-1183 (Nov. 22, 1991).
"Go With the Winners" Algorithms, David Aldous et al., Proceedings of the 35th Symposium on the Foundations of Computer Science, 1994, pp. 492-501.
"How to Use Expert Advice" Nicolo Cesa-Bianchi et al., Proceedings of the 25.sup.th Annual ACM Symposium on the Theory of Computing, (1993) pp. 382-391.
"Solving the Really Hard Problems with Cooperative Search", Tad Hogg et al., Proceedings of the 11.sup.th National Conference on Artificial Intelligence, 1993, pp. 231-236.
"A fast quantum mechnical algorithm for database search", by Lov K. Grover, Proceedings of the 28.sup.th Annual Symposium on the Theory of Computing, 1996, pp. 212-219.
Huberman Bernardo A.
Lukose Rajan
Banankhah Majid A.
Xerox Corporation
LandOfFree
Method and system for efficiently allocating resources for solvi does not yet have a rating. At this time, there are no reviews or comments for this patent.
If you have personal experience with Method and system for efficiently allocating resources for solvi, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Method and system for efficiently allocating resources for solvi will most certainly appreciate the feedback.
Profile ID: LFUS-PAI-O-1495505