We present KRCORE, an RDMA library with a microsecond-scale control plane on commodity RDMA hardware for elastic computing. KRCORE can establish a full-fledged RDMA connection within 10µs (hundreds or thousands o...
This paper deals with a numerical analysis of plastic deformation under various conditions, utilizing Radial Basis Function (RBF) approximation. The focus is on the elasto-plastic von Mises problem under plane-strain ...
详细信息
Cold data contributes a large portion of the big data today and is usually stored in secondary storage. Various sketch data structures are implemented to represent the stored elements and provide constant-time members...
详细信息
SmartNICs have recently emerged as an appealing device for accelerating distributedsystems. However, there has not been a comprehensive characterization of SmartNICs, and existing designs typically only leverage a si...
详细信息
Serverless platforms essentially face a tradeoff between container startup time and provisioned concurrency (i.e., cached instances), which is further exaggerated by the frequent need for remote container initializati...
详细信息
The rapid development in portable computing platforms, distributed multimedia systems and wireless communication technologies has led to a significant interest in mobile multimedia and wireless networking. Video enter...
详细信息
ISBN:
(纸本)0769513212
The rapid development in portable computing platforms, distributed multimedia systems and wireless communication technologies has led to a significant interest in mobile multimedia and wireless networking. Video entertainment and multimedia Internet access over wireless networks are examples of future wireless personal communication systems. These, however, incur challenging technological issues. The synchronization of the multimedia objects among mobile clients is one of the most important of these issues. The task of synchronization in wireless multimedia systems is to eliminate variations and delays incurred during the transmission of multiple-media streams and to maintain the temporal order among the various media streams. We propose an efficient distributed multimedia synchronization algorithm for wireless and mobile multimedia systems to ensure and facilitate mobile clients' access to multimedia objects. We discuss the algorithm and provide its formal proof and correctness.
The paper studies the characteristics of synchronous ordering of messages. Synchronous ordering of messages defines synchronous communication based on the causality rather than time. We present the sufficient conditio...
详细信息
The paper studies the characteristics of synchronous ordering of messages. Synchronous ordering of messages defines synchronous communication based on the causality rather than time. We present the sufficient conditions, based on the causality relations, for any algorithm to provide synchronous ordering. We also propose an algorithm using acknowledgment messages to implement the sufficient conditions. The algorithm is deadlock-free, and provides a higher degree of concurrency than existing algorithms.< >
Designing and debugging distributedsystems requires the detection of conditions across the entire system. As an illustration, monitoring the status of an application requires detection of termination, and using virtu...
详细信息
Designing and debugging distributedsystems requires the detection of conditions across the entire system. As an illustration, monitoring the status of an application requires detection of termination, and using virtual time requires the periodic calculation of the global virtual time. The generalized conjunctive predicate (GCP) detector offers a method to derive detection algorithms for these and other problems based on optimizing the base algorithm.
Ad hoc networks are wireless, mobile networks that can be set up anywhere and anytime without the aid of any established infrastructure or centralized administration. Because of the limited range of each host's wi...
详细信息
ISBN:
(纸本)0769510922
Ad hoc networks are wireless, mobile networks that can be set up anywhere and anytime without the aid of any established infrastructure or centralized administration. Because of the limited range of each host's wireless transmission, to communicate with hosts outside its transmission range, a host needs to enlist the aid of its nearby hosts in forwarding packets to the destination. However, since there is no stationary infrastructure such as base stations, each host has to act as a router for itself. A routing protocol for ad hoc networks is executed on every host and is therefore subject to the limit of the resources at each mobile host. A good routing protocol should minimize the computing load on the host as well as the traffic overhead on the network. Therefore, a number of routing protocols have been proposed for ad hoc wireless networks. We focus upon on-demand schemes. We study and compare the performance of the following three routing protocols AODV, CBRP and DSR. A variety of workload and scenarios, as characterized by mobility, load and size of the ad hoc network were simulated. Our results indicate that despite its improvement in reducing route request packets, CBRP has a higher overhead than DSR because of its periodic hello messages while AODV's end-to-end packet delay is the shortest when compared to DSR and CBRP.
暂无评论