BATON: A Balanced Tree Structure for Peer-to-Peer Networks

We propose a balanced tree structure overlay on a peer-to-peer network capable of supporting both exact queries and range queries efficiently. In spite of the tree structure causing distinctions to be made between nodes at different levels in the tree, we show that the load at each node is approximately equal. In spite of the tree structure providing precisely one path between any pair of nodes, we show that sideways routing tables maintained at each node provide sufficient fault tolerance to permit efficient repair. Specifically, in a network with N nodes, we guarantee that both exact queries and range queries can be answered in O(logN) steps and also that update operations (to both data and network) have an amortized cost of O(logN). An experimental assessment validates the practicality of our proposal.Singapore-MIT Alliance (SMA

Tigris: Architecture and Algorithms for 3D Perception in Point Clouds

Machine perception applications are increasingly moving toward manipulating and processing 3D point cloud. This paper focuses on point cloud registration, a key primitive of 3D data processing widely used in high-level tasks such as odometry, simultaneous localization and mapping, and 3D reconstruction. As these applications are routinely deployed in energy-constrained environments, real-time and energy-efficient point cloud registration is critical. We present Tigris, an algorithm-architecture co-designed system specialized for point cloud registration. Through an extensive exploration of the registration pipeline design space, we find that, while different design points make vastly different trade-offs between accuracy and performance, KD-tree search is a common performance bottleneck, and thus is an ideal candidate for architectural specialization. While KD-tree search is inherently sequential, we propose an acceleration-amenable data structure and search algorithm that exposes different forms of parallelism of KD-tree search in the context of point cloud registration. The co-designed accelerator systematically exploits the parallelism while incorporating a set of architectural techniques that further improve the accelerator efficiency. Overall, Tigris achieves 77.2$\times$ speedup and 7.4$\times$ power reduction in KD-tree search over an RTX 2080 Ti GPU, which translates to a 41.7% registration performance improvements and 3.0$\times$ power reduction.Comment: Published at MICRO-52 (52nd IEEE/ACM International Symposium on Microarchitecture); Tiancheng Xu and Boyuan Tian are co-primary author

What information and the extent of information research participants need in informed consent forms: a multi-country survey

Background: The use of lengthy, detailed, and complex informed consent forms (ICFs) is of paramount concern in biomedical research as it may not truly promote the rights and interests of research participants. The extent of information in ICFs has been the subject of debates for decades; however, no clear guidance is given. Thus, the objective of this study was to determine the perspectives of research participants about the type and extent of information they need when they are invited to participate in biomedical research. Methods: This multi-center, cross-sectional, descriptive survey was conducted at 54 study sites in seven Asia-Pacific countries. A modified Likert-scale questionnaire was used to determine the importance of each element in the ICF among research participants of a biomedical study, with an anchored rating scale from 1 (not important) to 5 (very important). Results: Of the 2484 questionnaires distributed, 2113 (85.1%) were returned. The majority of respondents considered most elements required in the ICF to be \u27moderately important\u27 to \u27very important\u27 for their decision making (mean score, ranging from 3.58 to 4.47). Major foreseeable risk, direct benefit, and common adverse effects of the intervention were considered to be of most concerned elements in the ICF (mean score = 4.47, 4.47, and 4.45, respectively). Conclusions: Research participants would like to be informed of the ICF elements required by ethical guidelines and regulations; however, the importance of each element varied, e.g., risk and benefit associated with research participants were considered to be more important than the general nature or technical details of research. Using a participant-oriented approach by providing more details of the participant-interested elements while avoiding unnecessarily lengthy details of other less important elements would enhance the quality of the ICF

Distributed Computing with Permissioned Blockchains and Databases (Dagstuhl Seminar 19261)

This seminar report contains the motivation, abstracts, and findings of Dagstuhl Seminar 19261 Distributed Computing with Permissioned Blockchains and Databases which took place in late June 2019. It brought together a very good mix of people from academia and industry as well as from databases and related areas for which blockchain is a current topic and who are either users or developers in that field

Histogram-based global load balancing in structured peer-to-peer systems

Over the past few years, peer-to-peer (P2P) systems have rapidly grown in popularity and have become a dominant means for sharing resources. In these systems, load balancing is a key challenge because nodes are often heterogeneous. While several load-balancing schemes have been proposed in the literature, these solutions are typically ad hoc, heuristic based, and localized. In this paper, we present a general framework, HiGLOB, for global load balancing in structured P2P systems. Each node in HiGLOB has two key components: 1) a histogram manager maintains a histogram that reflects a global view of the distribution of the load in the system, and 2) a load-balancing manager that redistributes the load whenever the node becomes overloaded or underloaded. We exploit the routing metadata to partition the P2P network into nonoverlapping regions corresponding to the histogram buckets. We propose mechanisms to keep the cost of constructing and maintaining the histograms low. We further show that our scheme can control and bound the amount of load imbalance across the system. Finally, we demonstrate the effectiveness of HiGLOB by instantiating it over three existing structured P2P systems: Skip Graph, BATON, and Chord. Our experimental results indicate that our approach works well in practice.ASTAR SER

Relaxed space bounding for moving objects: A case for the buddy tree

10.1145/1228268.1228272SIGMOD Record35424-29SREC

DUET - A database user interface design environment

10.1007/BF00962241Journal of Intelligent Information Systems33-4331-355JIIS