Search results
From MaRDI portal
- Critical review and examples of failure 1988-01-01 Paper Competitive snoopy caching 1988-01-01 Paper A parallel algorithm for bisection width in trees 1988-01-01...10 bytes (15 words) - 00:50, 23 September 2023
- date: 1987 zbMATH Keywords communication costs; multiprocessor system; snoopy caching Mathematics Subject Classification ID 68N25: Theory of operating systems...15 bytes (26 words) - 14:28, 5 February 2024
- paging; caching; pnline algorithms; World Wide Web Mathematics Subject Classification ID 68W05: Nonnumerical algorithms Cites Work Competitive snoopy caching...15 bytes (60 words) - 02:24, 30 January 2024
- Work A strongly competitive randomized paging algorithm Competitive snoopy caching On the influence of lookahead in competitive paging algorithms Blocking...15 bytes (72 words) - 16:57, 31 January 2024
- Work A strongly competitive randomized paging algorithm Competitive snoopy caching Competitive algorithms for server problems Unnamed Item Unnamed Item...15 bytes (79 words) - 12:48, 31 January 2024
- and retrieval of data Cites Work Unnamed Item Unnamed Item Competitive snoopy caching Random walks on weighted graphs and applications to on-line algorithms...15 bytes (95 words) - 12:48, 31 January 2024
- Classification ID 68W05: Nonnumerical algorithms Cites Work Competitive snoopy caching Randomized algorithms for metrical task systems Competitive randomized...15 bytes (96 words) - 11:32, 31 January 2024
- Classification ID 68W05: Nonnumerical algorithms Cites Work Competitive snoopy caching On the power of randomization in on-line algorithms Worst-Case Performance...15 bytes (92 words) - 02:24, 30 January 2024
- research Cites Work Unnamed Item Unnamed Item Unnamed Item Competitive snoopy caching On the competitiveness of on-line real-time task scheduling On the power...15 bytes (106 words) - 10:45, 31 January 2024
- on-line scheduling on uniformly related machines Cites Work Competitive snoopy caching An optimal algorithm for preemptive on-line scheduling Preemptive Scheduling...15 bytes (111 words) - 12:57, 31 January 2024
- Item Unnamed Item Unnamed Item Unnamed Item Unnamed Item Competitive snoopy caching On multiprocessor system scheduling Using parallel program characteristics...15 bytes (111 words) - 17:49, 1 February 2024
- Related Items Drifting games and Brownian motion Cites Work Competitive snoopy caching On 3-chromatic hypergraphs On a Combinatorial Problem of Erdös and Hajnal...15 bytes (117 words) - 07:48, 31 January 2024
- Competitive algorithms for distributed data management. Competitive snoopy caching On the power of randomization in on-line algorithms Fast algorithms...15 bytes (118 words) - 02:24, 30 January 2024
- Unnamed Item Unnamed Item Unnamed Item Searching in the plane Competitive snoopy caching Competitive paging with locality of reference Random walks on weighted...15 bytes (139 words) - 15:47, 1 February 2024
- Work A lower bound for randomized list update algorithms Competitive snoopy caching Two results on the list update problem The weighted list update problem...15 bytes (146 words) - 13:56, 31 January 2024
- backups Uses Software SNOOPY Cites Work Unnamed Item A strongly competitive randomized paging algorithm Competitive snoopy caching A competitive 2-server...15 bytes (160 words) - 13:53, 31 January 2024
- sets Cites Work A theory of diagnosis from first principles Competitive snoopy caching Two results on the list update problem Competitive algorithms for server...15 bytes (159 words) - 07:22, 31 January 2024
- randomized paging algorithm Shortest paths without a map Competitive snoopy caching On the power of randomization in on-line algorithms Competitive \(k\)-server...15 bytes (149 words) - 13:56, 31 January 2024
- fixed priority scheduling, offsets and co-prime task periods Competitive snoopy caching Scheduling periodically occurring tasks on multiple processors On the...15 bytes (149 words) - 13:48, 31 January 2024
- scheduling New algorithms for an ancient scheduling problem. Competitive snoopy caching A better lower bound for on-line scheduling A lower bound for randomized...15 bytes (152 words) - 02:24, 30 January 2024