Search Results - "Mendes, Hammurabi"

  • Showing 1 - 18 results of 18
Refine Results
  1. 1

    Using skip graphs for increased NUMA locality by Thomas, Samuel, Hayne, Roxana, Pulaj, Jonad, Mendes, Hammurabi

    “…We present a NUMA-aware concurrent data structure design based on a data-partitioned, concurrent skip graph indexed by thread-local sequential maps. Our design…”
    Get full text
    Journal Article
  2. 2

    Seriema: RDMA-based Remote Invocation with a Case-Study on Monte-Carlo Tree Search by Mendes, Hammurabi, Wiedenbeck, Bryce, O'Neill, Aidan

    “…We introduce Seriema, a middleware that integrates RDMA-based remote invocation, asynchronous data transfer, NUMA-aware automatic management of registered…”
    Get full text
    Conference Proceeding
  3. 3

    Multidimensional agreement in Byzantine systems by Mendes, Hammurabi, Herlihy, Maurice, Vaidya, Nitin, Garg, Vijay K.

    Published in Distributed computing (01-12-2015)
    “…Consider a network of n processes, where each process inputs a d -dimensional vector of reals. All processes can communicate directly with others via reliable…”
    Get full text
    Journal Article
  4. 4

    Using Skip Graphs for Increased NUMA Locality by Thomas, Samuel, Hayne, Roxana, Pulaj, Jonad, Mendes, Hammurabi

    “…High-performance simulations and parallel frameworks often rely on highly scalable, concurrent data structures for system scalability. With an increased…”
    Get full text
    Conference Proceeding
  5. 5

    Distributed Agreement in the Arrovian Framework by Wood, Kenan, Mendes, Hammurabi, Pulaj, Jonad

    Published 06-09-2024
    “…Preference aggregation is a fundamental problem in voting theory, in which public input rankings of a set of alternatives (called preferences) must be…”
    Get full text
    Journal Article
  6. 6

    Optimal Multilevel Slashing for Blockchains by Wood, Kenan, Mendes, Hammurabi, Pulaj, Jonad

    Published 13-05-2024
    “…We present the notion of multilevel slashing, where proof-of-stake blockchain validators can obtain gradual levels of assurance that a certain block is bound…”
    Get full text
    Journal Article
  7. 7

    A Concurrent Implementation of Skip Graphs by Mendes, Hammurabi, Fernandes, Cristina G.

    Published in Electronic notes in discrete mathematics (01-12-2009)
    “…In this extended abstract, we outline a concurrent implementation of a data structure called skip graphs. This data structure, proposed by Aspnes and Shah, has…”
    Get full text
    Journal Article
  8. 8

    Expiring Assets in Automated Market Makers by Wood, Kenan, Herlihy, Maurice, Mendes, Hammurabi, Pulaj, Jonad

    Published 08-01-2024
    “…An automated market maker (AMM) is a state machine that manages pools of assets, allowing parties to buy and sell those assets according to a fixed…”
    Get full text
    Journal Article
  9. 9

    Satisfiability Modulo Theories for Verifying MILP Certificates by Wood, Kenan, Zhou, Runtian, Wu, Haoze, Mendes, Hammurabi, Pulaj, Jonad

    Published 16-12-2023
    “…Correctness of results from mixed-integer linear programming (MILP) solvers is critical, particularly in the context of applications such as hardware…”
    Get full text
    Journal Article
  10. 10

    Seriema: RDMA-based Remote Invocationwith a Case-Study on Monte-Carlo Tree Search by Mendes, Hammurabi, Wiedenbeck, Bryce, O'Neill, Aidan

    Published 20-09-2021
    “…We introduce Seriema, a middleware that integrates RDMA-based remote invocation, asynchronous data transfer, NUMA-aware automatic management of registered…”
    Get full text
    Journal Article
  11. 11

    An architecture for P2P bag-of-tasks execution with multiple task allocation policies in desktop grids by Leite, Alessandro Ferreira, Mendes, Hammurabi Chagas, Weigang, Li, de Melo, Alba Cristina Magalhaes Alves, Boukerche, Azzedine

    Published in Cluster computing (01-12-2012)
    “…In this paper, we propose and evaluate a flexible architecture for desktop grids that supports multiple task allocation policies on top of a structured P2P…”
    Get full text
    Journal Article
  12. 12

    Tight Bounds for Connectivity and Set Agreement in Byzantine Synchronous Systems by Mendes, Hammurabi, Herlihy, Maurice

    Published 15-05-2015
    “…In this paper, we show that the protocol complex of a Byzantine synchronous system can remain $(k - 1)$-connected for up to $\lceil t/k \rceil$ rounds, where…”
    Get full text
    Journal Article
  13. 13

    Thermodynamic Hypothesis as Social Choice: An Impossibility Theorem for Protein Folding by Mendes, Hammurabi, Istrail, Sorin

    Published 02-04-2014
    “…Protein Folding is concerned with the reasons and mechanism behind a protein's tertiary structure. The thermodynamic hypothesis of Anfinsen postulates an…”
    Get full text
    Journal Article
  14. 14

    Using Skip Graphs for Increased NUMA Locality by Thomas, Samuel, Hayne, Ana, Pulaj, Jonad, Mendes, Hammurabi

    Published 18-02-2019
    “…We present a data partitioning technique performed over skip graphs that promotes significant quantitative and qualitative improvements on NUMA locality in…”
    Get full text
    Journal Article
  15. 15

    The Adaptive Priority Queue with Elimination and Combining by Calciu, Irina, Mendes, Hammurabi, Herlihy, Maurice

    Published 05-08-2014
    “…Priority queues are fundamental abstract data structures, often used to manage limited resources in parallel programming. Several proposed parallel priority…”
    Get full text
    Journal Article
  16. 16

    Distributed Computability in Byzantine Asynchronous Systems by Mendes, Hammurabi, Tasson, Christine, Herlihy, Maurice

    Published 25-02-2013
    “…In this work, we extend the topology-based approach for characterizing computability in asynchronous crash-failure distributed systems to asynchronous…”
    Get full text
    Journal Article
  17. 17

    Obtaining possible execution histories on multiple memory consistency models by Melo, A.C.M.A., Silva, N.S.B., Mendes, H.C., Aranha, D.F.

    “…In order to make shared memory programming possible in distributed architectures, we use an abstraction called distributed shared memory. The behavior of…”
    Get full text
    Conference Proceeding
  18. 18

    Bag-of-Tasks Self-Scheduling over Range-Queriable Search Overlays by Mendes, H., Li Weigang, Boukerche, A., Alves de Melo, A.C.M.

    “…The opportunistic computing paradigm is extremely valuable to modern technical and scientific endeavors, as it can support the demand for large and steady…”
    Get full text
    Conference Proceeding