| 集群下Cholesky分解的数据重用算法 |
| |
| 引用本文： | 刘凤,刘青昆.集群下Cholesky分解的数据重用算法[J].微计算机应用,2011,32(2):15-20. |
| |
| 作者姓名： | 刘凤 刘青昆 |
| |
| 作者单位： | 辽宁师范大学,计算机与信息技术学院,大连,116081 |
| |
| 摘 要： | 核外计算中,由于磁盘I/O操作特点是启动开销大,所以对文件的访问时间占的比例较大。如果能减少读取文件操作的次数则可以大幅度地提高运行效率。数据重用是一种有效的减少I/O操作次数的技术。本文将数据分成几个文件,然后将本次Cholesky分解完毕的文件继续的留在内存缓冲区中。当对下一个文件进行分解时,可用上一个刚分解完的文件进行数据的更新。这样就减少了读取数据的I/O操作次数,从而提高了分解效率。
|
| 关 键 词： | 数据重用 核外 集群 Cholesky分解 |
Data Reusing Algorithm of Cholesky Decomposition on Clusters |
| |
| LIU Feng,LIU Qingkun.Data Reusing Algorithm of Cholesky Decomposition on Clusters[J].Microcomputer Applications,2011,32(2):15-20. |
| |
| Authors: | LIU Feng LIU Qingkun |
| |
| Affiliation: | LIU Feng,LIU Qingkun(College of Computer and Information Technology,Liaoning Normal University,Dalian,116081,China) |
| |
| Abstract: | Access to files is a larger proportion of time because disk I/O operations are characterized by a large overhead starts in the Out-of-core computation.We can greatly improve the operating efficiency by reducing the number of operations to read the file.Data reusing is a technology which can reduce effectively the number of I/O operations.In this article the data was first divided into several files,then the file of Cholesky decomposition remain in the memory buffer.We used the file that has just been decomp... |
| |
| Keywords: | Data Reusing Out-of-core Clusters Cholesky decomposition |
| 本文献已被 CNKI 万方数据 等数据库收录！ |
|
