咨询与建议

限定检索结果

文献类型

  • 3 篇 会议
  • 1 篇 期刊文献

馆藏范围

  • 4 篇 电子文献
  • 0 种 纸本馆藏

日期分布

学科分类号

  • 4 篇 工学
    • 4 篇 计算机科学与技术...
    • 1 篇 电气工程

主题

  • 4 篇 asynchronous mes...
  • 3 篇 byzantine fault-...
  • 2 篇 causality
  • 2 篇 causal order
  • 1 篇 distributed syst...
  • 1 篇 causal multicast
  • 1 篇 feasibility cond...
  • 1 篇 distributed algo...
  • 1 篇 "happened before...
  • 1 篇 lower bound
  • 1 篇 consensus
  • 1 篇 optimal resilien...
  • 1 篇 multicast
  • 1 篇 unicast communic...
  • 1 篇 adopt-commit
  • 1 篇 unicast
  • 1 篇 synchrony assump...
  • 1 篇 signature-free a...
  • 1 篇 eventual timely ...
  • 1 篇 synchronization

机构

  • 2 篇 univ illinois il...
  • 1 篇 univ nantes lina...
  • 1 篇 univ rennes iris...
  • 1 篇 inst univ france
  • 1 篇 purdue univ ft w...
  • 1 篇 univ illinois de...

作者

  • 3 篇 misra anshuman
  • 3 篇 kshemkalyani aja...
  • 1 篇 raynal michel
  • 1 篇 mostfaoui achour
  • 1 篇 bouzid zohir

语言

  • 4 篇 英文
检索条件"主题词=asynchronous message-passing"
4 条 记 录,以下是1-10 订阅
排序:
Impossibility Results for Byzantine-Tolerant State Observation, Synchronization, and Graph Computation Problems
收藏 引用
ALGORITHMS 2025年 第1期18卷 26-26页
作者: Kshemkalyani, Ajay D. Misra, Anshuman Univ Illinois Dept Comp Sci Chicago IL 60607 USA Purdue Univ Ft Wayne Dept Comp Sci Ft Wayne IN 46805 USA
This paper considers the solvability of several fundamental problems in asynchronous message-passing distributed systems in the presence of Byzantine processes using distributed algorithms. These problems are the foll... 详细信息
来源: 评论
Byzantine Fault-Tolerant Causal Ordering  23
Byzantine Fault-Tolerant Causal Ordering
收藏 引用
24th International Conference on Distributed Computing and Networking (ICDCN)
作者: Misra, Anshuman Kshemkalyani, Ajay D. Univ Illinois Chicago IL 60607 USA
Byzantine fault-tolerant causal ordering of messages in asynchronous systems is useful to many applications. Although the problem has been studied for broadcast communication, it has not been examined for unicasts or ... 详细信息
来源: 评论
Causal Ordering in the Presence of Byzantine Processes  28
Causal Ordering in the Presence of Byzantine Processes
收藏 引用
IEEE 28th International Conference on Parallel and Distributed Systems (IEEE ICPADS)
作者: Misra, Anshuman Kshemkalyani, Ajay D. Univ Illinois Chicago IL 60607 USA
Causal ordering of messages in distributed systems is important for capturing application-level semantics. To the best of our knowledge, Byzantine fault-tolerant causal ordering has not been attempted for point-to-poi... 详细信息
来源: 评论
Minimal Synchrony for Byzantine Consensus  15
Minimal Synchrony for Byzantine Consensus
收藏 引用
34th Annual ACM Symposium on Principles of Distributed Computing (PODC)
作者: Bouzid, Zohir Mostfaoui, Achour Raynal, Michel Univ Rennes IRISA Rennes France Univ Nantes LINA F-44322 Nantes France Inst Univ France Paris France
Solving the consensus problem requires in one way or another that the underlying system satisfies some synchrony assumption. Considering an asynchronous message-passing system of n processes where (a) up to t bisourc... 详细信息
来源: 评论