Mohammad Javad Amiri, Divyakant Agrawal. On Sharding Permissioned Blockchains.. Retrieved from https://par.nsf.gov/biblio/10113697. IEEE International Conference on Blockchain .

Mohammad Javad Amiri, Divyakant Agrawal.. On Sharding Permissioned Blockchains.. IEEE International Conference on Blockchain, (). Retrieved from https://par.nsf.gov/biblio/10113697.

Mohammad Javad Amiri, Divyakant Agrawal.. "On Sharding Permissioned Blockchains.". IEEE International Conference on Blockchain (). Country unknown/Code not available. https://par.nsf.gov/biblio/10113697.

@article{osti_10113697,
place = {Country unknown/Code not available}, title = {On Sharding Permissioned Blockchains.}, url = {https://par.nsf.gov/biblio/10113697}, abstractNote = {Permissioned Blockchain systems rely mainly on Byzantine fault-tolerant protocols to establish consensus on the order of transactions. While Byzantine fault-tolerant protocols mostly guarantee consistency (safety) in an asynchronous network using 3f+1 machines to overcome the simultaneous malicious failure of any f nodes, in many systems, e.g., blockchain systems, the number of available nodes (resources) is much more than 3f + 1. To utilize such extra resources, in this paper we introduce a model that leverages transaction parallelism by partitioning the nodes into clusters (partitions) and processing independent transactions on different partitions simultaneously. The model also shards the blockchain ledger, assigns different shards of the blockchain ledger to different clusters, and includes both intra-shard and cross-shard transactions. Since more than one cluster is involved in each cross-shard transaction, the ledger is formed as a directed acyclic graph.}, journal = {IEEE International Conference on Blockchain}, author = {Mohammad Javad Amiri, Divyakant Agrawal}, }