Share This Author
TinyLFU: A Highly Efficient Cache Admission Policy
- Gil Einziger, R. Friedman
- Computer Science22nd Euromicro International Conference on…
- 12 February 2014
This paper proposes to use a frequency based cache admission policy in order to boost the effectiveness of caches subject to skewed access distributions through a novel approximate LFU structure called TinyLFU, which maintains an approximate representation of the access frequency of recently accessed objects.
On Power and Throughput Tradeoffs of WiFi and Bluetooth in Smartphones
- R. Friedman, Alex Kogan, Y. Krivolapov
- Computer ScienceIEEE Transactions on Mobile Computing
- 10 April 2011
The paper identifies many situations in which WiFi is superior to Bluetooth, countering previous reports and suggests a cross-layer optimization for TCP/IP that could greatly improve the throughput to power ratio whenever the transmitter is more capable than the receiver.
Starfish: Fault-Tolerant Dynamic MPI Programs on Clusters of Workstations
- A. Agbaria, R. Friedman
- Computer ScienceProceedings. The Eighth International Symposium…
- 3 August 1999
The architecture and design of Starfish is reported on, an environment for executing dynamic (and static) MPI-2 programs on a cluster of workstations that uses a novel architecture that is both flexible and portable and keeps group communication outside the critical data path, for maximum performance.
Heavy hitters in streams and sliding windows
- R. Ben-Basat, Gil Einziger, R. Friedman, Yaron Kassner
- Computer ScienceIEEE INFOCOM - The 35th Annual IEEE…
- 10 April 2016
This paper presents two novel algorithms for identifying heavy hitters in streams and sliding windows that use statically allocated memory and support constant time point queries.
Strong and weak virtual synchrony in Horus
This paper presents two variants of virtual synchrony, which are supported by Horus, and shows that in order to support this property, the application program has to block messages during view changes.
Failure detectors in omission failure environments
A weak failure detector ><W(om) is defined that allows any majority of the processes that become connected to reach a Consensus decision, despite any number of transient communication failures in their past.
Packing messages as a tool for boosting the performance of total ordering protocols
The main conclusion of this comparison is that message packing influences the performance of total ordering protocols under high load overwhelmingly more than any other optimization that was checked in this paper, both in terms of throughput and latency.
DEEP: Density-based proactive data dissemination protocol for wireless sensor networks with uncontrolled sink mobility
RAPID: Reliable Probabilistic Dissemination in Wireless Ad-Hoc Networks
- V. Drabkin, R. Friedman, G. Kliot, Marc Segal
- Computer Science26th IEEE International Symposium on Reliable…
- 10 October 2007
A novel reliable probabilistic dissemination protocol for mobile wireless ad-hoc networks that tolerates message omissions, node crashes, and selfish behavior and is highly resilient to mobility and failures is proposed.
FTS: a high-performance CORBA fault-tolerance service
This paper presents a lightweight CORBA fault-tolerance service called FTS. The service is based on standard portable features of CORBA, and in that respect is fully CORBA compliant, but does not…