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.


    Access

    Check access

    Check availability in my library

    Order at Subito €


    Export, share and cite



    Title :

    Greedy Signature Processing with Arbitrary Location Distributions: A Divisible Load Framework


    Contributors:


    Publication date :

    2012-10-01


    Size :

    2479204 byte




    Type of media :

    Article (Journal)


    Type of material :

    Electronic Resource


    Language :

    English




    Optimal time-varying load sharing for divisible loads

    Sohn, J. / Robertazzi, T.G. | IEEE | 1998



    Optimal divisible job load sharing for bus networks

    Sohn, J. / Robertazzi, T.G. | IEEE | 1996


    A Scheduling Algorithm with Divisible Load in Wireless Sensor Networks

    Dai, L. / Xu, H. / Chen, T. | British Library Online Contents | 2012