Amortized efficiency of list update and paging rules
Communications of the ACM
Online computation and competitive analysis
Online computation and competitive analysis
Best-fit bin-packing with random order
Proceedings of the seventh annual ACM-SIAM symposium on Discrete algorithms
The relative worst order ratio for online algorithms
ACM Transactions on Algorithms (TALG)
The relative worst-order ratio applied to paging
Journal of Computer and System Sciences
On the separation and equivalence of paging strategies
SODA '07 Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms
The relative worst order ratio applied to seat reservation
ACM Transactions on Algorithms (TALG)
Comparing First-Fit and Next-Fit for Online Edge Coloring
ISAAC '08 Proceedings of the 19th International Symposium on Algorithms and Computation
Scheduling Jobs on Grid Processors
Algorithmica
Theoretical evidence for the superiority of LRU-2 over LRU for the paging problem
WAOA'06 Proceedings of the 4th international conference on Approximation and Online Algorithms
Comparing several heuristics for a packing problem
International Journal of Advanced Intelligence Paradigms
Hi-index | 0.00 |
The problem of BLASTing a genome against a database of DNA sequences to identify potential relationships with other genomes can be divided into subproblems quite naturally. We consider a setting where the problem is distributed to PCs having idle time. This results in a new variant of bin packing, where a rectangle is divided into smaller rectangles that are to be packed in variable-sized bins which arrive on-line. A rectangle fits in a bin, if the sum of its height and width is no more than the size of the bin. The goal is to minimize the total size of the bins used for packing the entire rectangle.Simple algorithms exist that work well on small instances of the problem and in the special case where all processors (bins) have the same capacity. We propose an algorithm Slices that works well for more realistic instances in a scenario where the processors vary significantly and arrive on-line.