MetaCart Sign in to MyCiteSeerX

Include Citations | Advanced Search | Help

Disambiguated Search | Include Citations | Advanced Search | Help

Searching for authors named Orli Waarts – sorted by Relevance.

Order by: Citations | Year (Descending) | Year (Ascending) | Recency
Try your query at: Scholar | Yahoo! | Ask | Bing | CSB
Help! 18 documents found, showing 1 through 10. Next 10 →
ATOM RSS
  • Randomized Consensus In Expected Operations Per Processor  
  • by James Aspnes, Orli Waarts
  • …. This paper presents a new randomized algorithm for achieving consensus among asynchronous processors that communicate by reading and writing shared registers. The fastest previously known algorithm requires a processor to perform an expected O(n 2 log n) read and write operations in the worst ca…
  • Add To MetaCart
  • A Modular Measure of Competitive Performance for Distributed Algorithms  
  • by James Aspnes, Orli Waarts — 1995
  • …We define a novel measure of competitive performance for distributed algorithms based on throughput, the number of tasks that an algorithm can carry out in a fixed amount of work. This new measure complements the latency measure of Ajtai, Aspnes, Dwork, and Waarts [4], which measures how quickly an…
  • Cited by 1 (1 self) – Add To MetaCart
  • Modular Competitiveness for Distributed Algorithms  
  • by James Aspnes, Orli Waarts — 2000 — In Proc. 28th ACM Symp. on Theory of Computing (STOC
  • …We define a novel measure of competitive performance for distributed algorithms based on throughput, the number of tasks that an algorithm can carry out in a fixed amount of work. This new measure complements the latency measure of Ajtai et al. [3], which measures how quickly an algorithm can finish…
  • Cited by 13 (2 self) – Add To MetaCart
  • Competitive Access Time via Dynamic Storage Rearrangement  
  • by Amos Fiat, Yishay Mansour, Adi Rosén, Orli Waarts — 1995
  • …We deal with a natural generalization of one of the seminal problems in the study of on-line computation, list management [ST85a, IRSW91, Irani91]. We consider a doubly linked list with a pointer pointing to the last item accessed. Our goal, as with list management, is to minimize the total number o…
  • Cited by 4 (0 self) – Add To MetaCart
  • Improved Algorithms and Analysis for Secretary Problems and Generalizations  
  • by Miklos Ajtai, Nimrod Megiddo, Orli Waarts — 1995 — SIAM J. Discrete Math
  • …this paper weshow that, surprisingly, the two goals are in fact in conflict (see Section 1.2). It can be proven bybackward induction that there exists an optimal policy for minimizing the expected rank of selected item that has the following form: accept an object if and only if its rank relative to…
  • Cited by 10 (0 self) – Add To MetaCart
  • A Theory of Competitive Analysis for Distributed Algorithms  
  • by Miklos Ajtai, James Aspnes, Cynthia Dwork, Orli Waarts — 2003 — Proc. 35th Annual Symp. on Foundations of Computer Science
  • …We introduce a theory of competitive analysis for distributed algorithms. The first steps in this direction were made in the seminal papers of Bartal, Fiat, and Rabani [18], and of Awerbuch, Kutten, and Peleg [16], in the context of data management and job scheduling. In these papers, as well...…
  • Cited by 30 (5 self) – Add To MetaCart
  • Time-Lapse Snapshots  
  • by Cynthia Dwork, Maurice Herlihy, Serge Plotkin, Orli Waarts — 1994 — Proceedings of Israel Symposium on the Theory of Computing and Systems
  • …A snapshot scan algorithm takes an "instantaneous" picture of a region of shared memory that may be updated by concurrent processes. Many complex shared memory algorithms can be greatly simplified by structuring them around the snapshot scan abstraction. Unfortunately, the substantial decrease in …
  • Cited by 27 (8 self) – Add To MetaCart
  • Competitive Routing of Virtual Circuits with Unknown Duration  
  • by Baruch Awerbuch, Yossi Azar, Serge Plotkin, Orli Waarts — 1994 — In Proc. 5th ACM-SIAM Symposium on Discrete Algorithms
  • …In this paper we present a strategy to route unknown duration virtual circuits in a highspeed communication network. Previous work on virtual circuit routing concentrated on the case where the call duration is known in advance. We show that by allowing O(log n) reroutes per call, we can achieve O(lo…
  • Cited by 60 (17 self) – Add To MetaCart
  • Linearizable Counting Networks  
  • by Maurice Herlihy, Nir Shavit, Orli Waarts — 1991
  • …The counting problem requires n asynchronous processes to assign themselves successive values. A solution is linearizable if the order of the values assigned reflects the real-time order in which they were requested. Linearizable counting lies at the heart of concurrent time-stamp generation, as wel…
  • Cited by 77 (27 self) – Add To MetaCart
  • Contention in Shared Memory Algorithms  
  • by Cynthia Dwork, Maurice Herlihy, Orli Waarts — 1993
  • …Most complexitymeasures for concurrent algorithms for asynchronous sharedmemory architectures focus on process steps and memory consumption. In practice, however, performance of multiprocessor algorithms is heavily influenced by contention, the extent to which processes access the same location at t…
  • Cited by 57 (2 self) – Add To MetaCart
Help! Showing 1 through 10. Next 10 →
ATOM RSS
Try your query at: Scholar | Yahoo! | Ask | Bing | CSB