检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
机构地区:[1]浙江大学生物医学信息研究所,浙江杭州310027
出 处:《浙江大学学报(工学版)》2003年第2期178-184,共7页Journal of Zhejiang University:Engineering Science
基 金:浙江省"九五"重点科技资助项目(982101265).
摘 要:共享总线多微处理器系统具有相当高的性能价格比,但随着处理器速度的不断提高,总线通信带宽和可靠性成为限制并行处理能力的主要瓶颈.总线仲裁对提高系统性能具有关键的作用.分布式一致优先权机制是一种新型的仲裁机制模型.在此基础上提出了基于时间变化的优先权仲裁事务缓冲的分布式仲裁方案.仲裁缓冲机制能够充分利用系统总线的并发特性来提高总线的利用率,此机制有利于并行处理系统中的实时和总线重负载应用环境.虚拟令牌环和时变优先权策略为处理器节点公平地共享总线资源提供了保障.多字节优先权标识使优先权更易于扩展.仿真工作验证了所提方案的正确性.High ratio of performance against cost is a desirable feature of bus-shared multiprocessors systems. However, with the increasingly rapid growth of processor speed, the communication bandwidth and reliability of this system has become an essential factor affecting parallel processing. In the way for gaining improvement of overall performance of this system, bus arbitration is at the core position. The transaction-buffered time-variable priority arbitration scheme based on a novel arbitration model, distributed uniform priority model, is presented in this paper. The transaction-buffered arbitration mechanism uses the system bus property to raise the system's use ratio, which is very profitable for real-time applications and heavy bus load environment in parallel processing system. The virtual token ring and time-variable priority policies guarantee that shared fairly bus resources are accessed fairly by all processor nodes. Multi-byte priority policy makes scalable priority easier. Simulation and implementation work verified the feasibility of the presented arbitration scheme.
关 键 词:并行处理 仲裁缓冲 虚拟令牌环 实时仲裁 优先权队列
分 类 号:TP303[自动化与计算机技术—计算机系统结构]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.7