Prestaging objects in a distributed environment

• US 5,029,104 A
• Filed: 02/21/1989
• Issued: 07/02/1991
• Est. Priority Date: 02/21/1989
• Status: Expired due to Term

• Current Assignee: International Business Machines Corporation
• Original Assignee: International Business Machines Corporation
• Inventors: Dodson, George W., Mitchell, Michael O.
• Primary Examiner(s): Lall, Parshotam S.
• Assistant Examiner(s): NOT, DEFINED
• Application Number:
  US07/312,223
• Time in Patent Office: 861 Days
• Field of Search: 364/514, 364/516, 364/200, 364/900, 340/825.5, 340/825.51, 340/825.52, 358/141, 358/142, 370/79, 370/84, 370/95.1
• US Class Current: 709/217
• CPC Class Codes: G06F 9/54 Interprogram communication

Abstract

A distributed processing system includes a host and at least one connected work station. At the host there are included heuristic logic circuits which respond to information objects received at the host to determine the likelihood of use of each such object by the work station. Information objects likely to be used at the work station are voluntarily transmitted by the host to the work station prior to a request being made by the work station.

Claims

1. A distributed processing system having a host processor, a work station connected to said host processor, means for receiving data objects into said host processor, heuristic means in said host processor for predicting likelihood of use at said work station of different data objects, examining means in said host processor including said heuristic means for examining each of said data objects and for determining whether said each of said data objects is likely to be used at said work station, and transmitting means interconnected with said host processor and responsive to said examining means for voluntarily transmitting to said work station those of said data objects which said heuristic means determines is likely to be used at said work station.

2. The distributed processing system according to claim 1 further including storage means at said host processor for storing selected ones of said data objects.

3. The distributed processing system according to claim 1 further including work station storage means for storing at said work station selected ones of said data objects which said heuristic means determines is likely to be used at said work station.

4. The distributed processing system according to claim 3 in which said work station includes priority determination means for determining priorities of retention in said work station storage means of objects stored therewithin.

5. The distributed processing system according to claim 4 in which said priorities of retention in said work station storage means are effective to accord first priority of retention to the one of said data objects most recently received at said work station provided said most recently received object does not exceed a predetermined quantity of data.

6. The distributed processing system according to claim 4 in which said priorities of retention in said work station storage means are effective to accord first priority of retention to the one of said data objects most recently received at said work station.

7. The distributed processing system according to claim 4 in which said priorities of retention in said work station storage means are effective to accord last priority of retention to the most remotely used, as to time, object stored therewithin.

8. The distributed processing system according to claim 4 in which said priorities of retention in said work station storage means are effective to change the priority of an object according to the amount of use of said object at said work station.

9. The distributed processing system according to claim 4 in which said priorities of retention in said work station storage means are responsive to the use of an object to position the most recently used object to a predetermined high priority level.

10. The distributed processing system according to claim 4 in which said priorities of retention in said work station storage means are responsive to the use of an object to position the most recently used object to a predetermined higher priority level.

11. The distributed processing system according to claim 4 in which said priorities of retention in said work station storage means are effective to delete from said work station storage means objects which have not been used during a predetermined interval of time.

12. The distributed processing system according to claim 11 in which said predetermined interval of time is the most remote, as to time, interval of time.

13. The distributed processing system according to claim 1 further including host processor storage means for storing selected ones of said data objects and further including work station storage means for storing selected ones of said data objects which said heuristic means determines is likely to be used at said work station.

14. The distributed processing system according to claim 1 in which said transmitting means is effective to transmit data objects to said work station only when said host processor has not been called upon to perform other tasks.

15. The distributed processing system according to claim 1 in which said work station includes priority determination means for determining priorities of retention at said work station of objects received by said work station.

16. The distributed processing system according to claim 1 in which said voluntary transmitting is conducted in groups of objects.

17. A method of interacting a host processor with a connected work station including the steps of receiving at said host processor a plurality of data objects, examining each of said data objects, determining which of said data objects are likely to be used at said work station, transmitting to said work station prior to request from said work station those objects likely to be used at said work station, and storing at said work station selected ones of those objects received at said work station.

18. The method according to claim 17 further including the step of establishing within said work station a hierarchy of retention priorities for retaining stored objects at said work station.

19. The method according to claim 17 further including the step of storing said plurality of data objects at said host processor.

20. The method according to claim 17 further including the step of transmitting to said work station any object stored at said host processor and requested by said work station from said host processor.

21. The method according to claim 17 wherein said step of transmitting to said work station prior to request from said work station those objects likely to be used at said work station is performed only during times when said host processor is not otherwise busy.