from    
to    
search  

 


模块化多电平变换器的建模与控制
【低维量子物理国家重点实验室杰出学者讲座】Ultrafast magnetism – terra incogn...
第471期“工物学术论坛”:LHCb实验二期升级中的味物理的前景
【图书馆系列讲座】文献计量可视化分析工具——CiteSpace和VOSviewer的使用
报告题目:
Hashing and the New Multicore Algorithmics
 报告人:
Nir Shavit
Professor,Tel-Aviv University and Sun Labs
报告时间:
2008-10-13 16:45
报告地点:
FIT楼多功能厅
主办单位:
清华大学理论计算机科学研究中心
  简介:
 

Abstract:

As multicore machines become our mainstream computing platform, their unique architectural properties such as synchronization operations and coherent caches are forcing us to rethink our basic algorithms. The result is a flurry of activity in the concurrent algorithmics.

 

This paper will present concurrent hashing as an example of this new research wave. We will show two new high performance multicore hash-table algorithms: split-ordered hashing and hopscotch hashing. These algorithms are examples of how the new hardware has necessitated alternative algorithmic approaches, and how in turn these new algorithmics carry into the sequential world.

 

Biography:

Nir Shavit received a B.A. and M.Sc. from the Technion and a Ph.D. from the Hebrew University, all in Computer Science. He was a Postdoctoral Researcher at IBM Almaden Research Center, Stanford University, and MIT, and a Visiting Professor at MIT. He joined the computer science department at Tel-Aviv University in 1992 and was at various periods since 1999 a Member of Technical Staff at Sun Microsystems Laboratories. Prof. Shavit is the past Chair of the ACM PODC and SPAA conferences, a recipient of the Israeli Industry Research Prize in 1993, and of the ACM/EATCS Godel Prize in Theoretical Computer Science in 2004.
今日相关信息
Renaming is Weaker than Set Agreement
The Idea of Creation and Modern Science
开题与立项前的文献调研概述
 
同类别相关信息
清华RONG系列:大数据与可持续发展专场...
经验、认知与大数据清华大数据“技术前沿...
RONG系列·大数据大责任高峰论坛
Strong coupling of artificial atoms...
Nobel Dialogue: Global Development ...
学术活动