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

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 kth 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.

[1]  Debasish Ghose,et al.  Multi-installment load distribution in tree networks with delays , 1995 .

[2]  Bharadwaj Veeravalli,et al.  Scheduling divisible loads on heterogeneous linear daisy chain networks with arbitrary processor release times , 2004, IEEE Transactions on Parallel and Distributed Systems.

[3]  Chih-Ping Chu,et al.  Improved Methods for Divisible Load Distribution on k-Dimensional Meshes Using Multi-Installment , 2007, IEEE Transactions on Parallel and Distributed Systems.

[4]  Bharadwaj Veeravalli,et al.  Scheduling Divisible Loads with Processor Release Times and Finite Size Buffer Capacity Constraints in Bus Networks , 2004, Cluster Computing.

[5]  Thomas G. Robertazzi,et al.  Parallel Processor Configuration Design with Processing/Transmission Costs , 2000, IEEE Trans. Computers.

[6]  Bharadwaj Veeravalli,et al.  On the Influence of Start-Up Costs in Scheduling Divisible Loads on Bus Networks , 2000, IEEE Trans. Parallel Distributed Syst..

[7]  Maciej Drozdowski,et al.  Scheduling divisible loads in a three-dimensional mesh of processors , 1999, Parallel Comput..

[8]  Debasish Ghose,et al.  Adaptive Load Distribution Strategies for Divisible Load Processing on Resource Unaware Multilevel Tree Networks , 2007, IEEE Transactions on Computers.

[9]  Thomas G. Robertazzi,et al.  Distributed computation for a tree network with communication delays , 1990 .

[10]  Debasish Ghose,et al.  Distributed Computation with Communication Delays: Asymptotic Performance Analysis , 1994, J. Parallel Distributed Comput..

[11]  Pawel Wolniewicz,et al.  Experiments with Scheduling Divisible Tasks in Clusters of Workstations , 2000, Euro-Par.

[12]  Debasish Ghose,et al.  Scheduling Divisible Loads in Parallel and Distributed Systems , 1996 .

[13]  Bharadwaj Veeravalli,et al.  Design and Performance Analysis of Divisible Load Scheduling Strategies on Arbitrary Graphs , 2004, Cluster Computing.

[14]  Maciej Drozdowski,et al.  Multi‐installment divisible load processing in heterogeneous distributed systems , 2007, Concurr. Comput. Pract. Exp..

[15]  T.G. Robertazzi,et al.  Signature search time evaluation in flat file databases , 2008, IEEE Transactions on Aerospace and Electronic Systems.

[16]  Maciej Drozdowski,et al.  Scheduling for Parallel Processing , 2009, Computer Communications and Networks.

[17]  H. V. Jagadish,et al.  Partitioning Techniques for Large-Grained Parallelism , 1988, IEEE Trans. Computers.

[18]  Debasish Ghose,et al.  Adaptive divisible load scheduling strategies for workstation clusters with unknown network resources , 2005, IEEE Transactions on Parallel and Distributed Systems.

[19]  Thomas G. Robertazzi,et al.  Ten Reasons to Use Divisible Load Theory , 2003, Computer.

[20]  Stavros Christodoulakis,et al.  Implications of certain assumptions in database performance evauation , 1984, TODS.

[21]  Thomas G. Robertazzi.  Networks and grids - technology and theory , 2007, Information technology.

[22]  K. Fernow.  New York , 1896, American Potato Journal.

[23]  Guangzhong Sun,et al.  Distributed Scheduling Strategies for Processing Multiple Divisible Loads with Unknown Network Resources , 2007, 2007 IFIP International Conference on Network and Parallel Computing Workshops (NPC 2007).

[24]  Bharadwaj Veeravalli,et al.  Divisible load scheduling on arbitrary distributed networks via virtual routing approach , 2004, Proceedings. Tenth International Conference on Parallel and Distributed Systems, 2004. ICPADS 2004..

[25]  Bharadwaj Veeravalli,et al.  Divisible load scheduling on a hypercube cluster with finite-size buffers and granularity constraints , 2001, Proceedings First IEEE/ACM International Symposium on Cluster Computing and the Grid.

[26]  Debasish Ghose,et al.  Divisible Load Theory: A New Paradigm for Load Scheduling in Distributed Systems , 2004, Cluster Computing.

[27]  Thomas G. Robertazzi,et al.  Distributed computation with communication delay (distributed intelligent sensor networks) , 1988 .