咨询与建议

限定检索结果

文献类型

  • 14 篇 期刊文献
  • 6 篇 会议

馆藏范围

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

日期分布

学科分类号

  • 20 篇 工学
    • 20 篇 计算机科学与技术...
    • 8 篇 软件工程
    • 2 篇 电气工程
  • 3 篇 理学
    • 3 篇 数学

主题

  • 20 篇 wait-free algori...
  • 6 篇 shared memory
  • 5 篇 lock-free algori...
  • 5 篇 distributed comp...
  • 3 篇 asynchronous dis...
  • 3 篇 progress propert...
  • 3 篇 schedulers
  • 3 篇 asynchronous sha...
  • 2 篇 consensus
  • 2 篇 contention-sensi...
  • 2 篇 read/write regis...
  • 2 篇 renaming
  • 1 篇 test & set bits
  • 1 篇 collect
  • 1 篇 performance
  • 1 篇 reliability
  • 1 篇 concurrent queue...
  • 1 篇 message passing
  • 1 篇 low overhead
  • 1 篇 simulation

机构

  • 6 篇 technion israel ...
  • 2 篇 technion haifa
  • 2 篇 mit cambridge ma...
  • 2 篇 brown univ dept ...
  • 2 篇 tel aviv univ te...
  • 1 篇 compaq cambridge...
  • 1 篇 univ massachuset...
  • 1 篇 univ turin dept ...
  • 1 篇 msr cambridge ca...
  • 1 篇 univ toronto dep...
  • 1 篇 technion dept co...
  • 1 篇 queens univ belf...
  • 1 篇 microsoft res re...
  • 1 篇 ecole polytech m...
  • 1 篇 tel aviv univ de...
  • 1 篇 mit csail cambri...
  • 1 篇 univ pisa dept c...
  • 1 篇 wayne state univ...
  • 1 篇 tel aviv univ co...
  • 1 篇 dartmouth coll s...

作者

  • 4 篇 attiya h
  • 3 篇 alistarh dan
  • 3 篇 shavit nir
  • 3 篇 censor-hillel ke...
  • 2 篇 jayanti p
  • 2 篇 fouren a
  • 2 篇 herlihy m
  • 1 篇 meyerhenke henni...
  • 1 篇 meneghin massimi...
  • 1 篇 suri neeraj
  • 1 篇 taubenfeld g
  • 1 篇 desnoyers mathie...
  • 1 篇 dagenais michel ...
  • 1 篇 dwork c
  • 1 篇 petrank erez
  • 1 篇 herlihy mp
  • 1 篇 torquati massimo
  • 1 篇 angriman eugenio
  • 1 篇 waarts o
  • 1 篇 chaudhuri s

语言

  • 19 篇 英文
  • 1 篇 其他
检索条件"主题词=Wait-free algorithms"
20 条 记 录,以下是1-10 订阅
排序:
Parallel Adaptive Sampling with Almost No Synchronization  25th
Parallel Adaptive Sampling with Almost No Synchronization
收藏 引用
25th International Conference on Parallel and Distributed Computing (Euro-Par)
作者: van Der Grinten, Alexander Angriman, Eugenio Meyerhenke, Henning Humboldt Univ Dept Comp Sci Berlin Germany
Approximation via sampling is a widespread technique whenever exact solutions are too expensive. In this paper, we present techniques for an efficient parallelization of adaptive (a.k.a. progressive) sampling algorith... 详细信息
来源: 评论
Are Lock-free Concurrent algorithms Practically wait-free?
收藏 引用
JOURNAL OF THE ACM 2016年 第4期63卷 31-31页
作者: Alistarh, Dan Censor-Hillel, Keren Shavit, Nir ETH Inst Theoret Informat CAB J 21-5Univ Str 6 CH-8092 Zurich Switzerland Technion Dept Comp Sci IL-32000 Haifa Israel MIT 32 Vassar St32-G622 Cambridge MA 02139 USA Tel Aviv Univ Comp Sci & Artificial Intelligence Lab Stata Ctr 32 Vassar St32-G622 Cambridge MA 02139 USA
Lock-free concurrent algorithms guarantee that some concurrent operation will always make progress in a finite number of steps. Yet programmers prefer to treat concurrent code as if it were wait-free, guaranteeing tha... 详细信息
来源: 评论
Counting-based impossibility proofs for set agreement and renaming
收藏 引用
JOURNAL OF PARALLEL AND DISTRIBUTED COMPUTING 2016年 87卷 1-12页
作者: Attiya, Hagit Paz, Ami Technion Israel Inst Technol Dept Comp Sci IL-32000 Haifa Israel
Set agreement and renaming are two tasks that allow processes to coordinate, even when agreement is impossible. In k-set agreement, n processes must decide on at most k of their input values. While n-set agreement is ... 详细信息
来源: 评论
Are Lock-free Concurrent algorithms Practically wait-free?  14
Are Lock-Free Concurrent Algorithms Practically Wait-Free?
收藏 引用
46th Annual ACM Symposium on Theory of Computing (STOC)
作者: Alistarh, Dan Censor-Hillel, Keren Shavit, Nir MSR Cambridge Cambridge England Technion Haifa Israel MIT Cambridge MA 02139 USA Tel Aviv Univ Tel Aviv Israel MIT CSAIL Cambridge MA 02139 USA
Lock-free concurrent algorithms guarantee that some concurrent operation will always make progress in a finite number of steps. Yet programmers prefer to treat concurrent code as if it were wait-free, guaranteeing tha... 详细信息
来源: 评论
Brief Announcement: Are Lock-free Concurrent algorithms Practically wait-free?  14
Brief Announcement: Are Lock-Free Concurrent Algorithms Prac...
收藏 引用
ACM Symposium on Principles of Distributed Computing (PODC)
作者: Alistarh, Dan Censor-Hillel, Keren Shavit, Nir Microsoft Res Redmond WA 98052 USA Technion Haifa Israel MIT Cambridge MA 02139 USA Tel Aviv Univ Tel Aviv Israel
Lock-free concurrent algorithms guarantee that some concurrent operation will always make progress in a finite number of steps. Yet programmers would prefer to treat concurrent code as if it were wait-free, guaranteei... 详细信息
来源: 评论
An Efficient Unbounded Lock-free Queue for Multi-core Systems
收藏 引用
18th International Conference on Euro-Par Parallel Processing
作者: Aldinucci, Marco Danelutto, Marco Kilpatrick, Peter Meneghin, Massimiliano Torquati, Massimo Univ Turin Dept Comp Sci I-10124 Turin Italy Univ Pisa Dept Comp Sci Pisa Italy Queens Univ Belfast Dept Comp Sci Belfast Antrim North Ireland IBM Dublin Res Lab Dublin Ireland
The use of efficient synchronization mechanisms is crucial for implementing fine grained parallel programs on modern shared cache multi-core architectures. In this paper we study this problem by considering Single-Pro... 详细信息
来源: 评论
wait-free Queues With Multiple Enqueuers and Dequeuers  11
Wait-Free Queues With Multiple Enqueuers and Dequeuers
收藏 引用
16th ACM Symposium on Principles and Practice of Parallel Programming
作者: Kogan, Alex Petrank, Erez Technion Israel Inst Technol Dept Comp Sci IL-32000 Haifa Israel
The queue data structure is fundamental and ubiquitous. Lock-free versions of the queue are well known. However, an important open question is whether practical wait-free queues exist. Until now, only versions with li... 详细信息
来源: 评论
Synchronization for fast and reentrant operating system kernel tracing
收藏 引用
SOFTWARE-PRACTICE & EXPERIENCE 2010年 第12期40卷 1053-1072页
作者: Desnoyers, Mathieu Dagenais, Michel R. Ecole Polytech Montreal Dept Comp & Software Engn Montreal PQ H3C 3A4 Canada
To effectively trace an operating system, a performance monitoring and debugging infrastructure needs the ability to trace various execution contexts. These contexts range from kernel running as a thread to Non-Maskab... 详细信息
来源: 评论
On the Time-Complexity of Robust and Amnesic Storage
On the Time-Complexity of Robust and Amnesic Storage
收藏 引用
12th International Conference on Principles of Distributed Systems
作者: Dobre, Dan Majuntke, Matthias Suri, Neeraj Tech Univ Darmstadt D-64289 Darmstadt Germany
We consider wait-free implementations of a regular read/write register for unauthenticated data using a collection of 3t + k base objects, t of which can be subject to Byzantine failures. We focus on amnesic algorithm... 详细信息
来源: 评论
Generalized irreducibility of consensus and the equivalence of t-resilient and wait-free implementations of consensus
收藏 引用
SIAM JOURNAL ON COMPUTING 2004年 第2期34卷 333-357页
作者: Chandra, T Hadzilacos, V Jayanti, P Toueg, S IBM Corp Thomas J Watson Res Ctr Yorktown Hts NY 10598 USA Univ Toronto Dept Comp Sci Toronto ON MSS 3H5 Canada Dartmouth Coll Dept Comp Sci Hanover NH 03755 USA
We study the consensus problem, which requires multiple processes with different input values to agree on one of these values, in the context of asynchronous shared memory systems. Prior research focussed either on t-... 详细信息
来源: 评论