BSF:2012171:Progress Guarantees for Hardware Transactional Memory

BSF:2012171:硬件事务内存的进度保证

基本信息

  • 批准号:
    1331141
  • 负责人:
  • 金额:
    $ 4.5万
  • 依托单位:
  • 依托单位国家:
    美国
  • 项目类别:
    Standard Grant
  • 财政年份:
    2013
  • 资助国家:
    美国
  • 起止时间:
    2013-10-01 至 2018-09-30
  • 项目状态:
    已结题

项目摘要

This project is funded as part of the United States-Israel Collaboration in Computer Science (USICCS) program. Through this program, NSF and the United States - Israel Binational Science Foundation (BSF) jointly support collaborations among US-based researchers and Israel-based researchers. Until recently, processors became faster every year, because basic circuit elements like transistors and wires became both smaller and faster. Around 2005, things changed. Every year, circuits elements continue to become smaller, but they no longer become faster, because they overheat. In response, processor manufacturers now put multiple processors on each chip. Instead of doing one task faster, these multicore architectures do many tasks in parallel. This revolution in computer architecture presents enormous challenges to software designers, who must now structure software to exploit increasing parallelism, not speed.Recently, Intel and IBM announced new multicore architectures with direct hardware support for transactions, a programming abstraction that promises to make parallel software much easier to design. The move to hardware transactions can bring about a fundamental positive change in the way we program multicore machines, and now is the time to understand the implications of such a shift. The proposed research will center around rethinking and redesigning basic synchronization structures such as locks, memory management, and a range of concurrent data structures such as heaps, hash tables, and skip lists, and on how progress guarantees for these data structures interact with issues such as memory management.
该项目是美国-以色列计算机科学合作(USICCS)计划的一部分。通过这一计划,NSF和美国-以色列双国科学基金会(BSF)共同支持美国研究人员和以色列研究人员之间的合作。直到最近,处理器每年都变得更快,因为晶体管和电线等基本电路元件变得更小、更快。2005年前后,情况发生了变化。每年,电路元件都在继续变小,但它们不再变得更快,因为它们过热。作为回应,处理器制造商现在在每个芯片上安装了多个处理器。这些多核架构不是以更快的速度完成一项任务,而是并行执行多项任务。计算机体系结构的这场革命给软件设计人员带来了巨大的挑战,他们现在必须利用日益增长的并行性而不是速度来构建软件。最近,英特尔和IBM宣布了新的多核体系结构,具有对事务的直接硬件支持,这种编程抽象承诺使并行软件更容易设计。转向硬件事务可以给我们编程多核机器的方式带来根本性的积极变化,现在是时候了解这种转变的影响了。拟议的研究将围绕重新思考和重新设计基本同步结构(如锁、内存管理)和一系列并发数据结构(如堆、哈希表和跳过列表),以及这些数据结构的进度保证如何与内存管理等问题进行交互。

项目成果

期刊论文数量(0)
专著数量(0)
科研奖励数量(0)
会议论文数量(0)
专利数量(0)

数据更新时间:{{ journalArticles.updateTime }}

{{ item.title }}
{{ item.translation_title }}
  • DOI:
    {{ item.doi }}
  • 发表时间:
    {{ item.publish_year }}
  • 期刊:
  • 影响因子:
    {{ item.factor }}
  • 作者:
    {{ item.authors }}
  • 通讯作者:
    {{ item.author }}

数据更新时间:{{ journalArticles.updateTime }}

{{ item.title }}
  • 作者:
    {{ item.author }}

数据更新时间:{{ monograph.updateTime }}

{{ item.title }}
  • 作者:
    {{ item.author }}

数据更新时间:{{ sciAawards.updateTime }}

{{ item.title }}
  • 作者:
    {{ item.author }}

数据更新时间:{{ conferencePapers.updateTime }}

{{ item.title }}
  • 作者:
    {{ item.author }}

数据更新时间:{{ patent.updateTime }}

Maurice Herlihy其他文献

The topology of distributed adversaries
分布式对手的拓扑
  • DOI:
    10.1007/s00446-013-0189-9
  • 发表时间:
    2013
  • 期刊:
  • 影响因子:
    1.3
  • 作者:
    Maurice Herlihy;S. Rajsbaum
  • 通讯作者:
    S. Rajsbaum
Tight Bounds for Connectivity and Set Agreement in Byzantine Synchronous Systems
拜占庭同步系统中连接性和设定协议的严格界限
  • DOI:
    10.4230/lipics.disc.2017.35
  • 发表时间:
    2015
  • 期刊:
  • 影响因子:
    0
  • 作者:
    H. Mendes;Maurice Herlihy
  • 通讯作者:
    Maurice Herlihy
Invited Paper: Fault-tolerant and Expressive Cross-Chain Swaps
特邀论文:容错且富有表现力的跨链交换
Impossibility Results for Distributed Transactional Memory
分布式事务内存的不可能性结果
Algebraic spans
代数跨度

Maurice Herlihy的其他文献

{{ item.title }}
{{ item.translation_title }}
  • DOI:
    {{ item.doi }}
  • 发表时间:
    {{ item.publish_year }}
  • 期刊:
  • 影响因子:
    {{ item.factor }}
  • 作者:
    {{ item.authors }}
  • 通讯作者:
    {{ item.author }}

{{ truncateString('Maurice Herlihy', 18)}}的其他基金

FMitF:Collaborative Research:Track I:Formal Techniques for Monitoring Low-level Cross-chain Functions
FMITF:合作研究:第一轨:监控低级跨链功能的形式化技术
  • 批准号:
    1917990
  • 财政年份:
    2019
  • 资助金额:
    $ 4.5万
  • 项目类别:
    Standard Grant
SHF: Medium: Collaborative Research: Run-Time Support for Scalable Concurrent Programming
SHF:中:协作研究:可扩展并发编程的运行时支持
  • 批准号:
    1561807
  • 财政年份:
    2016
  • 资助金额:
    $ 4.5万
  • 项目类别:
    Standard Grant
SHF: Small: Collaborative Research: Concurrent Programming with Composable Transactional Objects
SHF:小型:协作研究:使用可组合事务对象进行并发编程
  • 批准号:
    1420673
  • 财政年份:
    2014
  • 资助金额:
    $ 4.5万
  • 项目类别:
    Standard Grant
SHF: Medium: Collaborative Research: Transactional Software Infrastructures: Making the Most of Hardware Transactions
SHF:媒介:协作研究:事务性软件基础设施:充分利用硬件事务
  • 批准号:
    1301924
  • 财政年份:
    2013
  • 资助金额:
    $ 4.5万
  • 项目类别:
    Continuing Grant
Combinatorial Topology and Concurrent Computation
组合拓扑和并发计算
  • 批准号:
    0830491
  • 财政年份:
    2009
  • 资助金额:
    $ 4.5万
  • 项目类别:
    Standard Grant
A Unified Open-Source Transactional-Memory Infrastructure
统一的开源事务内存基础设施
  • 批准号:
    0811289
  • 财政年份:
    2008
  • 资助金额:
    $ 4.5万
  • 项目类别:
    Standard Grant
Transactional Memory
事务内存
  • 批准号:
    0410042
  • 财政年份:
    2004
  • 资助金额:
    $ 4.5万
  • 项目类别:
    Standard Grant
Topological Methods in Distributed and Concurrent Computatioin
分布式并发计算中的拓扑方法
  • 批准号:
    9912401
  • 财政年份:
    2000
  • 资助金额:
    $ 4.5万
  • 项目类别:
    Standard Grant
CONACyT: Topological Methods in Distributed and Concurrent Computation
CONACyT:分布式并发计算中的拓扑方法
  • 批准号:
    9613785
  • 财政年份:
    1996
  • 资助金额:
    $ 4.5万
  • 项目类别:
    Continuing Grant
CONACyT: Applications of Algebraic Topology to Concurrent Computation
CONACyT:代数拓扑在并发计算中的应用
  • 批准号:
    9505949
  • 财政年份:
    1995
  • 资助金额:
    $ 4.5万
  • 项目类别:
    Standard Grant
{{ showInfoDetail.title }}

作者:{{ showInfoDetail.author }}

知道了