초록 ▼

In a network-connected distributed system including nodes through which digital data flow, one or more of the nodes adapted to process the digital data, a method for efficiently managing the transmission of units of digital data from node to node includes the steps of receiving, at one of the one or

In a network-connected distributed system including nodes through which digital data flow, one or more of the nodes adapted to process the digital data, a method for efficiently managing the transmission of units of digital data from node to node includes the steps of receiving, at one of the one or more nodes, units of digital data first transmitted by an originating node; queuing, for processing at other nodes, one or more units of the digital data; prioritizing the queued units of digital data for transmission to a next node based on prioritizing information; and updating the prioritizing information according to results of processing performed in and received from the one of the one or more nodes and/or other nodes in the system.

대표청구항 ▼

In a network-connected distributed system including nodes through which digital data flow, one or more of the nodes adapted to process the digital data, a method for efficiently managing the transmission of units of digital data from node to node includes the steps of receiving, at one of the one or

In a network-connected distributed system including nodes through which digital data flow, one or more of the nodes adapted to process the digital data, a method for efficiently managing the transmission of units of digital data from node to node includes the steps of receiving, at one of the one or more nodes, units of digital data first transmitted by an originating node; queuing, for processing at other nodes, one or more units of the digital data; prioritizing the queued units of digital data for transmission to a next node based on prioritizing information; and updating the prioritizing information according to results of processing performed in and received from the one of the one or more nodes and/or other nodes in the system. , and the at least one marker data record has a known key; and hashing the known key for the marker data record to locate the marker data record in the hash table, and walking to one or more adjacent actual data records to determine the distribution of data records resulting from the hash function. 2. A method according to claim 1 including inserting one or more additional marker data records to the hash table at corresponding different known keys. 3. A method according to claim 2 wherein the known keys of the marker data records are chosen according to a marker record distribution function. 4. A method according to claim 3 wherein the distribution function is periodic. 5. A method according to claim 4 wherein the known keys are spaced at regular intervals. 6. A method according to claim 1 wherein the hash function used to insert actual data records is changed based on the determined distribution of data records. 7. A method comprising: inserting a plurality of actual data records and a plurality of marker data records in a hash table using a hash function, wherein the actual data records and marker data records have a logical ordering specified by a key, the keys of the actual data records have a range, the actual data records and marker records are not logically ordered in the hash table, one or more of the actual data records and one or more of the marker data records in the hash table include a pointer to a logically preceding and proceeding actual data record, and the keys of the marker data records are distributed at known positions throughout the range of the keys of the actual data records; and hashing a known key for the marker data record to locate the marker data record in the hash table, and walking to one or more adjacent actual data records to determine the distribution of data records resulting from the hash function. 8. A method according to claim 7 including inserting one or more additional marker data records into the hash table in response to adding one or more additional actual records to hash table. 9. A method according to claim 8 wherein the known keys of the marker data records are identified using a marker record distribution function. 10. A method according to claim 9 wherein the distribution function is periodic. 11. A method according to claim 10 wherein the known keys are spaced at regular intervals. 12. A method according to claim 9 wherein the mark records are inserted so as to guarantee a record will be present for known keys in the hash table. 13. A method according to claim 6 wherein the hash function used to insert actual data records is changed based on the determined distribution of data records. 14. A system comprising: a data storage medium storing a hash table including a plurality of actual data records and at least one marker data record inserted in the hash table using a hash function, wherein the actual data records are not logically ordered in the hash table, and the at least one marker data record has a known key; and a record distribution examination module receiving a known key and outputting an indication of the distribution of actual data records around the marker data record corresponding to the known key. 15. A system according to claim 14 wherein the module comprises a computer program executing on a computing platform. 16. A system according to claim 15 wherein the data storage medium is one or more of the following: random access memory, magnetic storage medium, and optical storage medium. 17. A computer readable media having instructions stored thereon for causing a computer to perform a method comprising: inserting a plurality of actual data records and at least one marker data record in a hash table using a hash function, wherein the actual data records are not logically ordered in the hash table, wherein one or more of the actual data records and the marker data record in the hash table include a pointer to a logically preceding and proceeding actual data record, and the at least one marker data record has a known key; and hashing the known key for the marker data record to locate the marker data record in the hash table, and walking to one or more adjacent actual data records to determine the distribution of data records resulting from the hash function. 18. A computer readable media having instructions stored thereon for causing a computer to perform a method comprising: inserting a plurality of actual data records and a plurality of marker data records in a hash table using a hash function, wherein the actual data records and marker data records have a logical ordering specified by a key, the keys of the actual data records have a range, the actual data records and marker records are not logically ordered in the hash table, one or more of the actual data records and one or more of the marker data records in the hash table include a pointer to a logically preceding and proceeding actual data record, and the keys of the marker data records are distributed at known positions throughout the range of the keys of the actual data records; and hashing a known key for the marker data record to locate the marker data record in the hash table, and walking to one or more adjacent actual data records to determine the distribution of data records resulting from the hash function. 19. The computer readable medium of claim 18, wherein the method further comprises inserting one or more additional marker data records into the hash table in response to adding one or more additional actual records to hash table. 20. The computer readable medium of claim 18, wherein the known keys of the marker data records are identified using a marker record distribution function. e premise is determined to be true, an alternate action, wherein the alternate action is performed if the premise is determined to be false, and a trigger, wherein the trigger causes evaluation of the premise upon the occurrence of a predetermined event.