Match!
arXiv: Distributed, Parallel, and Cluster Computing
Papers
6009
Papers 4611
1 page of 462 pages (4,611 results)
Newest
This paper presents Istanbul BFT (IBFT), a Byzantine fault-tolerant (BFT) consensus algorithm that is used for implementing state-machine replication in the Quorum blockchain, n open source permissioned blockchain platform. IBFT belongs to a class of BFT algorithms that assume a partially synchronous communication model. The IBFT algorithm is deterministic, leader-based, and optimally resilient - tolerating ffaulty processes out of n where n \geq 3f+1 During periods of good communicatio...
#1Lucas Kuhring (IMDEA)
#2Zsolt Istvan (IMDEA)H-Index: 10
Last.Marko Vukolic (IBM)H-Index: 22
view all 4 authors...
Permissioned blockchains promise secure decentralized data management in business-to-business use-cases. In contrast to Bitcoin and similar public blockchains which rely on Proof-of-Work for consensus and are deployed on thousands of geo-distributed nodes, business-to-business use-cases (such as supply chain management and banking) require significantly fewer nodes, cheaper consensus, and are often deployed in datacenter-like environments with fast networking. However, permissioned blockchains o...
Many recent breakthroughs in deep learning were achieved by training increasingly larger models on massive datasets. However, training such models can be prohibitively expensive. For instance, Megatron Language Model with 8.3B parameters was trained on a GPU cluster worth \$25 million. As a result, most researchers cannot afford to train state of the art models and contribute to their development. Hypothetically, a researcher could crowdsource the training of large neural networks with thousands...
Linear algebra operations have been widely used in big data analytics and scientific computations. Many works have been done on optimizing linear algebra operations on GPUs with regular-shaped input. However, few works are focusing on fully utilizing GPU resources when the input is not regular-shaped. Current optimizations lack of considering fully utilizing the memory bandwidth and computing power, therefore they could only achieve sub-optimal performance. In this paper, we propose two efficien...
#1Giuseppe Antonio Di Luna (Sapienza University of Rome)H-Index: 10
#2Paola Flocchini (U of O: University of Ottawa)H-Index: 40
Last.Yukiko Yamauchi (Kyushu University)H-Index: 10
view all 5 authors...
We investigate computational issues in the distributed model Amoebots of programmable matter. In this model, the computational entities, called particles, are anonymous finite-state machines that operate and move on an hexagonal tasselation of the plane. In this paper we show how a constant number of such weak particles can simulate a powerful Turing-complete entity that is able to move on the plane while computing. We then show an application of our tool to the classical Shape-Formation problem...
#1Sadek Ferdous (SUST: Shahjalal University of Science and Technology)
#2Mohammad Jabed Morshed Chowdhury (La Trobe University)H-Index: 4
Last.Alan Colman (Swinburne University of Technology)H-Index: 18
view all 4 authors...
In recent years, blockchain technology has received unparalleled attention from academia, industry, and governments all around the world. It is considered a technological breakthrough anticipated to disrupt several application domains. This has resulted in a plethora of blockchain systems for various purposes. However, many of these blockchain systems suffer from serious shortcomings related to their performance and security, which need to be addressed before any wide-scale adoption can be achie...
Last.Yogesh Simmhan (IISc: Indian Institute of Science)H-Index: 1
view all 3 authors...
Property graphs are a common form of linked data, with path queries used to traverse and explore them for enterprise transactions and mining. Temporal property graphs are a recent variant where time is a first-class entity to be queried over, and properties and structure varying over time. These are seen in social, telecom and transit networks. However, current graph databases and query engines have limited support for temporal relations among graph entities, no support for time-varying entities...
Byzantine fault tolerance (BFT) has been extensively studied in distributed trustless systems to guarantee system's functioning when up to 1/3 Byzantine processes exist. Despite a plethora of previous work in BFT systems, they are mainly concerned about common knowledge deducible from the states of all participant processes. In BFT systems, it is crucial to know about which knowledge a process knows about the states of other processes and the global state of the system. However, there is a lack ...
#1Garvit Dewan (IITR: Indian Institute of Technology Roorkee)
#2Louis Jenkins (UR: University of Rochester)H-Index: 1
The partitioned global address space has bridged the gap between shared and distributed memory, and with this bridge comes the ability to adapt shared memory concepts, such as non-blocking programming, to distributed systems such as supercomputers. To enable non-blocking algorithms, we present ways to perform scalable atomic operations on objects in remote memory via remote direct memory address and pointer compression. As a solution to the problem of concurrent-safe reclamation of memory in a d...
Diversity maximization is a fundamental problem in web search and data mining. For a given dataset Sof nelements, the problem requires to determine a subset of Scontaining k\ll n"representatives" which minimize some diversity function expressed in terms of pairwise distances, where distance models dissimilarity. An important variant of the problem prescribes that the solution satisfy an additional orthogonal requirement, which can be specified as a matroid constraint (i.e., a feasibl...
12345678910
Top fields of study
Distributed computing
Parallel computing
Computer science
Real-time computing
Cloud computing