Export Citations
Save this search
Please login to be able to save your searches and receive alerts for new content matching your search criteria.
- research-articleJune 2022
Quantifiability: a concurrent correctness condition modeled in vector space
Computing (CMPT), Volume 105, Issue 5May 2023, Pages 955–978https://doi.org/10.1007/s00607-022-01092-3AbstractArchitectural imperatives due to the slowing of Moore’s Law, the broad acceptance of relaxed semantics and the O(n!) worst case verification complexity of generating sequential histories motivate a new approach to concurrent correctness. ...
- ArticleSeptember 2021
Design and Implementation of Highly Scalable Quantifiable Data Structures
AbstractArchitectural imperatives due to the slowing of Moore’s Law, the broad acceptance of relaxed semantics and the O(n!) worst case verification complexity of generating sequential histories motivate a new approach to concurrent correctness. ...
- research-articleJune 2021
Descriptor based consensus for blockchain transactions
DEBS '21: Proceedings of the 15th ACM International Conference on Distributed and Event-based SystemsJune 2021, Pages 114–125https://doi.org/10.1145/3465480.3466927Blockchain networks use consensus mechanisms so participants can exchange transactions without the need to rely on a trusted third party. Consensus mechanisms using Proof of Work burn significant energy to select a block miner and the delay limits ...
- ArticleAugust 2020
Entropy Measurement of Concurrent Disorder
Quantitative Evaluation of SystemsAug 2020, Pages 239–257https://doi.org/10.1007/978-3-030-59854-9_18AbstractThere is an imminent demand to understand the relationship between correctness and performance to deliver highly scalable multiprocessor programs. The motivation for this relationship is that relaxed correctness conditions provide performance ...