• 设为首页
  • 点击收藏
  • 手机版
    手机扫一扫访问
    迪恩网络手机版
  • 关注官方公众号
    微信扫一扫关注
    公众号

C++实现的IO高效的算法TPIE

原作者: [db:作者] 来自: [db:来源] 收藏 邀请
C++实现的IO高效的算法
类似的有berkeley DB Hash等
TPIE
The data sets involved in some modern applications are too large to fit in the main memory of even the
most powerful computers and must therefore reside on disk. Thus communication between internal and
external memory, and not actual computation time, often becomes the bottleneck in the computation.
This is due to the huge difference in access time of fast internal memory and slower external memory such
as disks. While typical access time of main memory is measured in nanoseconds, a typical access time of
a disk is on the order of milliseconds [20]. So roughly speaking there is a factor of a million difference in
the access time of internal and external memory. A good example of an applications involving massive
amounts of geometric data is NASA’s Earth Observation System (EOS) [29, 42], which is expected to
manipulate petabytes (thousands of terabytes, or millions of gigabytes) of data.
The goal of theoretical work in the area of external memory (EM) algorithms (also called I/O algorithms
or out-of-core algorithms) is to eliminate or minimize the I/O bottleneck through better algorithm
design.
具体的算法地址
http://www.cs.duke.edu/TPIE
http://www.madalgo.au.dk/Trac-tpie
TPIE, a Transparent Parallel I/O Environment, designed to assist programmers
in writing high performance I/O-efficient programs for a variety of platforms.
这个算法对IO进行了抽象,实现了栈、B树等算法
效率的测试方法
http://algo2.iti.kit.edu/dementiev/stxxl/trunk/containers_2berkeley__db__benchmark_8cpp-example.html

鲜花

握手

雷人

路过

鸡蛋
该文章已有0人参与评论

请发表评论

全部评论

专题导读
上一篇:
C++vector用法(转)发布时间:2022-07-13
下一篇:
细嚼慢咽C++primer(1)——指针,void*型指针,const限定符(2) ...发布时间:2022-07-13
热门推荐
阅读排行榜

扫描微信二维码

查看手机版网站

随时了解更新最新资讯

139-2527-9053

在线客服(服务时间 9:00~18:00)

在线QQ客服
地址:深圳市南山区西丽大学城创智工业园
电邮:jeky_zhao#qq.com
移动电话:139-2527-9053

Powered by 互联科技 X3.4© 2001-2213 极客世界.|Sitemap