127,567 research outputs found
Design and implementation of the fast send protocol
Over the last decades Internet traffic has grown dramatically. Besides the number of transfers, data sizes have risen as well. Traditional transfer protocols do not adapt to this evolution. Large-scale computational applications running on expensive parallel computers produce large amounts of data which often have to be transferred to weaker machines at the clients' premises. As parallel computers are frequently charged by the minute, it is indispensable to minimize the transfer time after computation succeeded to keep down costs. Consequently, the economic focus lies on minimizing the time to move away all data from the parallel computer whereas the actual time to arrival remains less (but still) important. This paper describes the design and implementation of a new transfer protocol, the Fast Send Protocol (FSP), which employs striping to intermediate nodes in order to minimize sending time and to utilize the sender's resources to a high extent
Generalized Paxos Made Byzantine (and Less Complex)
One of the most recent members of the Paxos family of protocols is
Generalized Paxos. This variant of Paxos has the characteristic that it departs
from the original specification of consensus, allowing for a weaker safety
condition where different processes can have a different views on a sequence
being agreed upon. However, much like the original Paxos counterpart,
Generalized Paxos does not have a simple implementation. Furthermore, with the
recent practical adoption of Byzantine fault tolerant protocols, it is timely
and important to understand how Generalized Paxos can be implemented in the
Byzantine model. In this paper, we make two main contributions. First, we
provide a description of Generalized Paxos that is easier to understand, based
on a simpler specification and the pseudocode for a solution that can be
readily implemented. Second, we extend the protocol to the Byzantine fault
model
The End of Slow Networks: It's Time for a Redesign
Next generation high-performance RDMA-capable networks will require a
fundamental rethinking of the design and architecture of modern distributed
DBMSs. These systems are commonly designed and optimized under the assumption
that the network is the bottleneck: the network is slow and "thin", and thus
needs to be avoided as much as possible. Yet this assumption no longer holds
true. With InfiniBand FDR 4x, the bandwidth available to transfer data across
network is in the same ballpark as the bandwidth of one memory channel, and it
increases even further with the most recent EDR standard. Moreover, with the
increasing advances of RDMA, the latency improves similarly fast. In this
paper, we first argue that the "old" distributed database design is not capable
of taking full advantage of the network. Second, we propose architectural
redesigns for OLTP, OLAP and advanced analytical frameworks to take better
advantage of the improved bandwidth, latency and RDMA capabilities. Finally,
for each of the workload categories, we show that remarkable performance
improvements can be achieved
Wisent: Robust Downstream Communication and Storage for Computational RFIDs
Computational RFID (CRFID) devices are emerging platforms that can enable
perennial computation and sensing by eliminating the need for batteries.
Although much research has been devoted to improving upstream (CRFID to RFID
reader) communication rates, the opposite direction has so far been neglected,
presumably due to the difficulty of guaranteeing fast and error-free transfer
amidst frequent power interruptions of CRFID. With growing interest in the
market where CRFIDs are forever-embedded in many structures, it is necessary
for this void to be filled. Therefore, we propose Wisent-a robust downstream
communication protocol for CRFIDs that operates on top of the legacy UHF RFID
communication protocol: EPC C1G2. The novelty of Wisent is its ability to
adaptively change the frame length sent by the reader, based on the length
throttling mechanism, to minimize the transfer times at varying channel
conditions. We present an implementation of Wisent for the WISP 5 and an
off-the-shelf RFID reader. Our experiments show that Wisent allows transfer up
to 16 times faster than a baseline, non-adaptive shortest frame case, i.e.
single word length, at sub-meter distance. As a case study, we show how Wisent
enables wireless CRFID reprogramming, demonstrating the world's first
wirelessly reprogrammable (software defined) CRFID.Comment: Accepted for Publication to IEEE INFOCOM 201
- …