• Corpus ID: 2168100

Faster kinetic heaps and their use in broadcast scheduling

@inproceedings{Kaplan2001FasterKH,
  title={Faster kinetic heaps and their use in broadcast scheduling},
  author={Haim Kaplan and Robert E. Tarjan and Kostas Tsioutsiouliklis},
  booktitle={SODA '01},
  year={2001}
}
We describe several implementations of the kinetic heap, a heap (priority queue) in which the key of each item, instead of being fixed, is a linear function of time. The kinetic heap is a simple example of a kinetic data structure of the kind considered by Basch, Guibas, and Hershberger. Kinetic heaps have many applications in computational geometry, and previous implementations were designed to address these applications. We describe an additional application, to broadcast scheduling. Each of… 
View on ACM
23 Citations
Highly Influential Citations
1
Background Citations
9
Methods Citations
3

23 Citations

Citation Type

Citation Type

Hyperbolic Caching: Flexible Caching for Web Applications
TLDR
This work designs a new caching algorithm for web applications called hyperbolic caching, which decays item priorities at variable rates and continuously reorders many items at once and introduces the notion of a cost class in order to measure the costs and manipulate the priorities of all items belonging to a related group.
Algorithms for Minimizing Response Time in Broadcast Scheduling
TLDR
This paper gives a 4-speed, 1-approximation algorithm improving the previous bound of 6-speed-1-app approximation algorithm and a 1/α- speed, polynomial time algorithm with an approximation ratio of 1/(1 – α).
Self-adjusting computation
  • R. Harper
  • Computer Science
    Proceedings of the 19th Annual IEEE Symposium on Logic in Computer Science, 2004.
  • 2004
TLDR
Self-adjusting computation is a method for deriving a dynamic algorithm for a problem by "dynamizing" a static algorithm for it.
Algorithms for Minimizing Response Time in Broadcast Scheduling
In this paper we study the following problem. There are n pages which clients can request at any time. The arrival times of requests for pages are known. Several requests for the same page may arrive…
Self-Adjusting Programming
TLDR
This papers proposes techniques for writing self-adjusting programs that can adjust to any change to their data and shows that the techniques are flexible, efficient, and practical by implementing a Standard ML library for kinetic data structures and applying the library to kinetic convex hulls.
Algorithms for dynamic geometric data streams
TLDR
This thesis develops data streaming algorithms, which process the data sequencially without storing, and introduces data stream algorithms to approximately count minors like triangles or bipartite cliques in huge graphs given as data streams that can be used to obtain structural information about sozial graphs and the webgraph.
Efficient Kinetic Data Structures for MaxCut
We develop a randomized kinetic data structure that maintains a partition of the moving points into two sets such that the corresponding cut is with probability at least 1 % a (1 )-approximation of…
A maiden analysis of longest wait first
TLDR
This work provides the first non-trivial analysis of the worst case performance of the Longest Wait First (LWF), and shows that LWF is not s-speed O(1)-competitive for s < 1+&sqrt;5/2.
Update-Aware Scheduling Algorithms for Hierarchical Data Dissemination Systems
TLDR
This paper proposes three broadcast scheduling algorithms that primarily differ in how data dissemination with update propagation is guided at the primary and secondary servers and presents mechanisms based on real and predicted clients' access patterns.
Dynamic Maintenance of the Lower Envelope of Pseudo-Lines
TLDR
A new algorithm is devised for finding the intersection between two lower envelopes of pseudo-lines in $O(\log n)$ time, using \emph{tentative} binary search; theLower envelopes are special in that at $x=-\infty$ any pseudo-line contributing to the first envelope lies below every pseudo- line contribute to the second envelope.
...
...

References

SHOWING 1-10 OF 18 REFERENCES
Buckets, heaps, lists, and monotone priority queues
TLDR
The heap-on-top (hot) priority queue data structure that combines the multilevel bucket data structure of Denardo and Fox with a heap is introduced and used to obtain an improved bound for Dijkstra's shortest path algorithm.
Data structures for mobile data
TLDR
This talk will survey the general ideas behind Kinetic data structures and illustrate their application to simple geometric problems that arise in virtual and physical environments.
Scheduling for large-scale on-demand data broadcasting
  • D. Aksoy, M. Franklin
  • Computer Science
    Proceedings. IEEE INFOCOM '98, the Conference on Computer Communications. Seventeenth Annual Joint Conference of the IEEE Computer and Communications Societies. Gateway to the 21st Century (Cat. No.98
  • 1998
TLDR
A parameterized algorithm is introduced that provides good performance across all of these criteria and can be tuned to emphasize either average or worst case waiting time and makes scheduling decisions based on the current queue state.
Fibonacci Heaps and Their Uses in Improved Network Optimization Algorithms
TLDR
Using F-heaps, a new data structure for implementing heaps that extends the binomial queues proposed by Vuillemin and studied further by Brown, the improved bound for minimum spanning trees is the most striking.
Broadcast Delivery
  • J. Wong
  • Computer Science
    Proc. IEEE
  • 1988
TLDR
The architecture and performance of systems that use a broadcast channel to deliver information to a community of users are discussed, and existing scheduling algorithms are described and their mean-response-time performance evaluated.
Self-adjusting binary search trees
TLDR
The splay tree, a self-adjusting form of binary search tree, is developed and analyzed and is found to be as efficient as balanced trees when total running time is the measure of interest.
Decomposable Searching Problems I: Static-to-Dynamic Transformation
Maintenance of Configurations in the Plane
Dynamic planar convex hull operations in near-logarithmic amortized time
We give a data structure that allows arbitrary insertions and deletions on a planar point set P and supports basic queries on the convex hull of P, such as membership and tangent-finding. Updates…
Amortized Computational Complexity
TLDR
This paper surveys recent work by several researchers on amortized complexity and obtains “self-adjusting” data structures that are simple, flexible and efficient.
...
...