QQ登录

只需要一步,快速开始

 注册地址  找回密码
查看: 2078|回复: 0
打印 上一主题 下一主题

每日科技报告 第59期 New Software Design Technique Allows Programs to Run Faster

[复制链接]
字体大小: 正常 放大

522

主题

10

听众

4072

积分

升级  69.07%

  • TA的每日心情
    奋斗
    2015-1-3 17:18
  • 签到天数: 6 天

    [LV.2]偶尔看看I

    自我介绍
    学习中!

    优秀斑竹奖 元老勋章 新人进步奖 最具活力勋章

    群组Matlab讨论组

    群组C 语言讨论组

    群组每天多学一点点

    群组数学趣味、游戏、IQ等

    群组南京邮电大学数模协会

    跳转到指定楼层
    1#
    发表于 2010-4-7 09:33 |只看该作者 |倒序浏览
    |招呼Ta 关注Ta
    本帖最后由 sea_star666 于 2010-4-7 09:36 编辑

    Researchers at North Carolina State University have developed a new approach to software development that will allow common computer programs to run up to 20 percent faster and possibly incorporate new security measures.

    The researchers have found a way to run different parts of some programs -- including, for the first time, such widely used programs as word processors and Web browsers -- at the same time, which makes the programs operate more efficiently.
    In order to understand how they did it, you have to know a little bit about computers. The brain of a computer chip is its central processing unit, or "core." Computing technology has advanced to the point where it is now common to have between four and eight cores on each chip. But for a program to utilize these cores, it has to be broken down into separate "threads" -- so that each core can execute a different part of the program simultaneously. The process of breaking down a program into threads is called parallelization, and allows computers to run programs very quickly.
    However, some programs are difficult to parallelize, including word processors and Web browsers. These programs operate much like a flow chart -- with certain program elements dependent on the outcome of others. These programs can only utilize one core at a time, minimizing the benefit of multi-core chips.
    But NC State researchers have developed a technique that allows hard-to-parallelize applications to run in parallel, by using nontraditional approaches to break programs into threads.
    Every computer program consists of multiple steps. The program will perform a computation, then perform a memory-management function -- which prepares memory storage to contain data or frees up memory storage which is currently in use. It repeats these steps over and over again, in a cycle. And, for difficult-to-parallelize programs, both of these steps have traditionally been performed in a single core.
    "We've removed the memory-management step from the process, running it as a separate thread," says Dr. Yan Solihin, an associate professor of electrical and computer engineering at NC State, director of this research project, and co-author of a pa-per describing the research. Under this approach, the computation thread and memory-management thread are executing simultaneously, allowing the computer program to operate more efficiently.
    "By running the memory-management functions on a separate thread, these hard-to-parallelize programs can operate approximately 20 percent faster," Solihin says. "This also opens the door to development of new memory-management functions that could identify anomalies in program behavior, or perform additional security checks. Previously, these functions would have been unduly time-consuming, slowing down the speed of the overall program."
    Using the new technique, when a memory-management function needs to be performed, "the computational thread notifies the memory-management thread -- effectively telling it to allocate data storage and to notify the computational thread of where the storage space is located," says Devesh Tiwari, a Ph.D. student at NC State and lead author of the pa-per. "By the same token, when the computational thread no longer needs certain data, it informs the memory-management thread that the relevant storage space can be freed."
    The pa-per, "MMT: Exploiting Fine-Grained Parallelism in Dynamic Memory Management," will be presented April 21 at the IEEE International Parallel and Distributed Processing Symposium in Atlanta. The research was funded by the National Science Foundation. The pa-per is co-authored by Tiwari, Solihin, NC State Ph.D. student Sanghoon Lee and Dr. James Tuck, an assistant professor of electrical and computer engineering at NC State.
    zan
    转播转播0 分享淘帖0 分享分享0 收藏收藏0 支持支持0 反对反对0 微信微信
    第一次用linux登录madio,纪念一下
    您需要登录后才可以回帖 登录 | 注册地址

    qq
    收缩
    • 电话咨询

    • 04714969085
    fastpost

    关于我们| 联系我们| 诚征英才| 对外合作| 产品服务| QQ

    手机版|Archiver| |繁體中文 手机客户端  

    蒙公网安备 15010502000194号

    Powered by Discuz! X2.5   © 2001-2013 数学建模网-数学中国 ( 蒙ICP备14002410号-3 蒙BBS备-0002号 )     论坛法律顾问:王兆丰

    GMT+8, 2025-11-8 10:23 , Processed in 0.410572 second(s), 51 queries .

    回顶部