助手标题  
全文文献 工具书 数字 学术定义 翻译助手 学术趋势 更多
查询帮助
意见反馈
   reconfigurable buses 的翻译结果: 查询用时:0.006秒
图标索引 在分类学科中查询
所有学科
计算机硬件技术
更多类别查询

图标索引 历史查询
 

reconfigurable buses
相关语句
  相似匹配句对
     Parallel Computational Models and Algorithms with Reconfigurable Optical Buses
     可重构的光总线并行计算模型及其算法
短句来源
     Buses Dispatching
     公交车调度
短句来源
     Reconfigurable Computer
     可重构计算机
短句来源
     Hybrid Buses
     混合动力公共汽车
短句来源
     Reconfigurable Information Processing
     可重构信息处理
短句来源
查询“reconfigurable buses”译词为用户自定义的双语例句

    我想查看译文中含有:的双语例句
例句
为了更好的帮助您理解掌握查询词或其译词在地道英语中的实际用法,我们为您准备了出自英文原文的大量英语例句,供您参考。
  reconfigurable buses
In this paper, we present a new parametric parallel algorithm for semigroup computation on mesh with reconfigurable buses (MRB).
      
Several different mesh like architectures with reconfigurable buses have been proposed in the literature.
      


A sorting processor array architecture with N1+ processors and a reconfigurable bussystem with N1+ 1-bit reconfigurable buses, which sorts N s-bit numbers in a constant time, isproposed in this paper, where e is an arbitrary small positive constant. Previous sorting work archivedthe constant time is on the same kind of processor array with N3 processors and N2 s -bitsreconfigurable buses, where s=log2N.

本文提出一个具有N1+ε台处理机和带有N1+ε个1-位(二进制位)的可变结构的总线系统的SIMD阵列处理机系统.其中,ε是任意小的正常数.它具有常数步排序能力.先前具有常数步排序能力的系统[7]其处理机台数为N3,所带可变结构总线为N2个S-二进制位的可变结构总线,其中,S=log2N.

Triangulation of simple polygons is one of the fundamental problems in computational geometry, and has many important applications in computer graphics, geographical information systems, finite element methods, and many other fields. The reconfigurable mesh consists of an array of processors interconnected by a reconfigurable bus system. The bus system can be used to dynamically obtain various interconnection patterns among the processors. Recently, this model has attracted a lot of attention....

Triangulation of simple polygons is one of the fundamental problems in computational geometry, and has many important applications in computer graphics, geographical information systems, finite element methods, and many other fields. The reconfigurable mesh consists of an array of processors interconnected by a reconfigurable bus system. The bus system can be used to dynamically obtain various interconnection patterns among the processors. Recently, this model has attracted a lot of attention. The main contribution of this paper is to exploit the advantage of the model to obtain efficient algorithms for triangulation of simple polygons and monotone polygons. First we propose a sequential algorithm to divide a simple polygon to some disjoint special monotone polygons, and obtain a constant time algorithm to divide a monotone polygon to disjoint special monotone polygons on an n×n reconfigurable mesh based on it, where n is the number of points of the input polygon. Then we divide the reconfigurable mesh into some submeshes corresponding to the special monotone polygons, and assign each special monotone polygon to one submesh. Because these submeshes can execute the algorithm in parallel and a constant time algorithm to triangulate a special monotone polygon on the reconfigurable mesh has been proposed by Bokka et al., so we get an algorithm to triangulate a monotone polygon in O(1) time on an n×n reconfigurable mesh. By generalizing these algorithms and using a little more processors, we obtain another algorithm to triangulate a simple polygon in O(1) time on an n×n 1+ε reconfigurable mesh, where 0< ε <1 is a constant. To the best of our knowledge, this is the first time that constant time solutions to triangulation of monotone polygons and simple polygons are reported. We also believe that the methods proposed in the paper can be used to design efficient parallel algorithms for other problems in computation geometry.

简单多边形的三角剖分是计算几何的基本问题之一 ,在计算机图形学、地理信息系统及有限元方法等领域有许多重要的应用 .可重构造网孔机器是近几年出现的一种新的并行计算模型 ,由于其特有的灵活性 ,已经有很多领域的基本问题在这种模型上得到了研究 .该文在这种结构上考虑了简单多边形的三角剖分问题 :提出了一个将简单多边形分解为特殊单调多边形的算法 ,并在规模为 n× n的可重构造网孔机器上实现了常数时间分解单调多边形为特殊单调多边形的并行算法 ,基于这个算法得到了一个 n× n的机器上常数时间三角剖分单调多边形的算法 ;将这些算法稍加推广 ,并使用稍多的处理器 ,得到了一个在规模为 n× n1 +ε(0 <ε<1为常数 )的可重构造网孔机器上三角剖分简单多边形的常数时间算法 .就目前了解到的情况而言 ,这分别是第一个在常数时间三角剖分单调多边形和简单多边形的并行算法

 
图标索引 相关查询

 


 
CNKI小工具
在英文学术搜索中查有关reconfigurable buses的内容
在知识搜索中查有关reconfigurable buses的内容
在数字搜索中查有关reconfigurable buses的内容
在概念知识元中查有关reconfigurable buses的内容
在学术趋势中查有关reconfigurable buses的内容
 
 

CNKI主页设CNKI翻译助手为主页 | 收藏CNKI翻译助手 | 广告服务 | 英文学术搜索
版权图标  2008 CNKI-中国知网
京ICP证040431号 互联网出版许可证 新出网证(京)字008号
北京市公安局海淀分局 备案号:110 1081725
版权图标 2008中国知网(cnki) 中国学术期刊(光盘版)电子杂志社