The optimal partition of a huge, linear (flat) file among processing nodes in a network to minimize the time to search for signatures of interest in the file is considered. First, an expression is developed for the expected time of finding the $k$th signature (including the last signature) of $K$ signatures for a uniform distribution of signatures in the file. Secondly, for a single signature we propose processing data in the file in order from that with the most probability mass (i.e., data with the most a priori likelihood of containing the signature) to that with the least probability mass in a "greedy" manner to speed processing time. Applications of this work include radar, sensors, image processing, and search.
Greedy Signature Processing with Arbitrary Location Distributions: A Divisible Load Framework
IEEE Transactions on Aerospace and Electronic Systems ; 48 , 4 ; 3027-3041
2012-10-01
2479204 byte
Article (Journal)
Electronic Resource
English
Optimal Divisible Job Load Sharing for Bus Networks
Online Contents | 1996
|Optimal time-varying load sharing for divisible loads
IEEE | 1998
|Optimal Time-Varying Load Sharing for Divisible Loads
Online Contents | 1998
|Optimal divisible job load sharing for bus networks
IEEE | 1996
|A Scheduling Algorithm with Divisible Load in Wireless Sensor Networks
British Library Online Contents | 2012
|