Obtaining the optimal configuration of high-radix Combined switches

High-radix switches reduce network cost and improve network performance, especially in large switch-based interconnection networks. However, there are some problems related to the integration scale to implement such switches in a single chip. An interesting alternative for building high-radix switches consists of combining several current smaller single-chip switches to obtain switches with a greater number of ports. A key design issue of this kind of high-radix switches is the internal switch configuration, specifically, the correspondence between the ports of these high-radix switches and the ports of their smaller internal single-chip switches. In this paper we use artificial intelligence and data mining techniques in order to obtain the optimal internal configuration of all the switches in the network of large supercomputers running parallel applications. Simulation results show that using the resultant switch configurations, it is possible to achieve similar performance as with single-chip switches with the same radix, which would be unfeasible with the current integration scale.     

Calculating polynomial zeros on a local memory parallel computer

We consider the calculation, on a local memory parallel computer, of all the zeros of an n th degree polynomial P_n(x) which has real coefficients. We describe a generic parallel algorith, which approximates all the zeros simultaneously and we give three specific examples of this algorithm which have orders of convergence two, three and four. We report extensive numerical tests of the algorithms; the fourth order algorithm is not robust, with many failures to convergence, whereas the other two algorithms are reliable and display very respectable parallel speedups for higher degree polynomials.     

Concurrent behavior: A construct to specify the external behavior of objects in object databases

We present a linguistic construct to define concurrency control for the objects of an object database. This construct, calledconcurrent behavior, allows to define a concurrency control specification for each object type in the database; in a sense, it can be seen as a type extension. The concurrent behavior is composed by two parts: the first one, calledcommutativity specification, is a set of conditional rules, by which the programmer specifies when two methods do not conflict each other. The second part, the constraint specification, is a set of guarded regular expressions, calledconstraints, by which the programmer defines the allowed sequences of method calls. At each time during an actual execution, a subset of constraints may be active so limiting the external behavior of the object. A constraint becomesactive when its guard is verified, where a guard is composed of the occurrence of some method callm along with the verification of a boolean expression on the object state and the actual parameters ofm. A constraint dies when a string of the language corresponding to the regular expression has been recognized. While the commutativity specification is devoted to specify the way in which the external behavior of an object is influenced by the existence of concurrent transactions in the system, the constraint specification defines the behavior of the object, independently from the transactions. Since the two parts of the concurrent behavior are syntactically distinct and, moreover, each of them consists of a set of independent rules, modularity in specifying the objects is enhanced, with respect to a unique specification. We outline an implementation of the construct, which is based on a look-ahead policy: at each method execution, we foresee the admissible successive behaviors of the object, instead of checking the admission of each request at the time it is actually made.     

Dual-Object: 面向对象的并行程序设计

面向对象的并行程序设计提供了类似于共享内存模型对通讯和计算的抽象能力,从而非常适合于大型并行软件系统的开发．但是基于远程对象调用的分布式对象的实现效率一直是面向对象方法在分布式／并行程序设计中得到广泛应用的障碍．本文介绍了并行机ＭＡＮＮＡ上所采用的面向对象的并行程序设计模型——Ｄｕａｌ－Ｏｂｊｅｃｔ模型．该模型通过引入从语义角度出发给出的数据一致特性的描述,在一定程度上解决了实现效率低下的问题．其次,文章通过程序设计实例详细地讨论了基于Ｄｕａｌ－Ｏｂｊｅｃｔ模型的扩展Ｃ＋＋并行程序设计,并给出了部分实际测试结果．     

路径表达式的并行算法研究

在面向对象数据库系统中,路径表达式是用于定位复杂对象的必要查询设施,因此,优化和并行化路径表达式的执行是实现高性能面向对象数据库系统的关键因素之一,由于ＯＱＬ语言的正交性,在ＳＥＬＥＣＴ,ＦＲＯＭ和（或）ＷＨＥＲＥ子句中均可嵌套路径表达式,而我们将着重讨论ＷＨＥＲＥ子句子路径表达式的并行计算,种路径表达式也称之为复杂谓词。本文分析了现有路径表达式的计算方法后,提出了两种新的路径表达式并行计算算法,     

Preemptive and non-preemptive scheduling of optical switches with configuration delay

Utilizing optical technologies for the design of packet switches and routers offers several advantages in terms of scalability, high bandwidth, power consumption, and cost. However, the configuration delays of optical crossbars are much longer than that of the electronic counterpart, which makes the conventional slot-by-slot scheduling methods no longer the feasible solution. Therefore, some tradeoff must be found between the empty time slots and configuration overhead. This paper classifies such scheduling problems into preemptive and non-preemptive scenarios, each has its own advantages and disadvantages. Although non-preemptive scheduling is inherently not good at achieving the above-mentioned tradeoff, it is shown, however, that the proposed maximum weight matching (MWM) based greedy algorithm is guaranteed to achieve an approximation 2 for arbitrary configuration delay, and with a relatively low time complexity O(N2). For preemptive scheduling, a novel 2-approximation heuristic is presented. Each time in finding a switch configuration, the 2-approximation heuristic guarantees the covering cost of the remaining traffic matrix to have 2-approximation. Simulation results demonstrate that 2-approximation heuristic (1) performs close to the optimal scheduling, and (2) outperforms ADJUST and DOUBLE in terms of traffic transmission delay and time complexity.     

SKEL: A fundamental property desirable in ATM switches for simple traffic management - illustrations with generic output-buffered and input-buffered switches

To simplify traffic control in a network, it is desirable that the traffic-control policy at a network node depends only on the external traffic loads on the input and output links, but not on the detail addressing or distribution of packets from inputs to outputs. In other words, it should be possible to guarantee the grade-of-service of an input-output connection by controlling the aggregate loads on the input and output. Switch nodes in which such a traffic-control policy is possible are said to have the property of the sufficiency of the knowledge of external loads (SKEL). One way to demonstrate the feasibility of SKEL for a particular switch is to show that the performance under any nonuniform traffic distribution from inputs to outputs is better than or close to the performance under the uniform traffic distribution. The contributions of this paper are twofold: clarifying issues related to SKEL and establishing its feasibility for generic input- and output-buffered switches on a rigorous basis. The following summarizes our major results: (1) The packet-loss probability due to the Knockout switch-design principle for packets destined for an arbitrary output is maximum when the traffic to that output originates uniformly from all inputs; (2) The packet-loss probability for packets destined for a particular output under uniform traffic closely approximates the loss probability for packets from the worst-case input to that output under nonuniform traffic; (3) For mean and variance of delay, similar results as in (1) and (2) can be obtained; (4) For an input-queued switch, external link loadings that do not give rise to queue saturation under uniform traffic will not do so under nonuniform traffic either.     

基于绝缘液体充填封装RFMEMS开关特性分析

提出并设计一种采用绝缘液体充填封装的RF MEMS开关,分析其工作原理,并以高压油、蓖麻油、甘油为绝缘液体充填封装,仿真分析绝缘液体对RF MEMS开关的驱动电压、冲击速度、响应时间、开关电容等方面的影响。结果表明:绝缘液体充填封装有效地将驱动电压降为原来的1/εr,降低上极板对下极板的冲击速度。对3种液态封装材料性能分析,蓖麻油效果最好:阈值电压下降了一半,约为10 V;当驱动电压为20 V时,响应时间为40.6μs,优于高压油(91.3μs)、甘油(89.9μs),冲击速度约为1.26 m/s。     

一个实用面向对象软件度量工具的设计与实现

在分析了多种面向对象度量模型的基础上 ,设计并实现了一种实用的面向对象软件度量工具 .该工具从结构上保证了面向对象度量和面向结构度量的结合 ,与直接度量和间接度量的结合 .详细介绍了对象特征的分析 ,以及特征集和度量指标的存储设计 .最后举例验证该设计的实用性 ,并指出需进一步改进的方面 .     

Data reduction and fast routing: A strategy for efficient algorithms for message-passing parallel computers

This paper presents several algorithms for solving problems using massively parallel SIMD hypercube and shuffle-exchange computers. The algorithms solve a wide variety of problems, but they are related because they all use a common strategy. Specifically, all of the algorithms use a divide-and-conquer approach to solve a problem withN inputs using a parallel computer withP processors. The structural properties of the problem are exploited to assure that fewer thanN data items are communicated during the division and combination steps of the divide-and-conquer algorithm. This reduction in the amount of data that must be communicated is central to the efficiency of the algorithm.This paper addresses four problems, namely the multiple-prefix, data-dependent parallel-prefix, image-component-labeling, and closest-pair problems. The algorithms presented for the data-dependent parallel-prefix and closest-pair problems are the fastest known whenN P and the algorithms for the multiple-prefix and image-component-labeling problems are the fastest known whenN is sufficiently large with respect toP.This work was supported in part by our NSF Graduate Fellowship.     

对象关系的外连式实现方法

对象间关系的重要性已经得到广泛重视，但在现行程序语言中尚示获得全面支持，本文在论述了对象间关系的描述特性，分析了内嵌式和外连式两种关系实现方法的特点后，提出并深入讨论了外连式对象间关系的程序描述和实现方法，本文提出的方法已经通过基于C＋＋的程序转换的方法得到实现。     

Using objects to handle complexity in finite element software

Engineering software is becoming ever more complex. Finite element programs have sophisticated graphical input and output facilities, and are increasingly required to be linked to other software such as CAD or databases. The paper shows how an object oriented approach to finite element programming can be used to handle this complexity. This requires an approach that is very different from that adopted in more traditional programming. A foundation finite element class system is developed. This represents the essential data structure of the main finite element classes. It is then shown how this system can be used in a graphical model of two dimensional structures. The finite element system imposed no constraints on the development of the graphical model, yet could still be used easily. An important feature is that the nodes and elements are distributed around the graphical model, rather than being held centrally. For instance nodes may belong to points or lines of the graphical model. This means that the data structure used in the program more closely matches the way that the user of the program is likely to think.     

An efficient data processing framework for mining the massive trajectory of moving objects

Recently, there has been increasing development of positioning technology, which enables us to collect large scale trajectory data for moving objects. Efficient processing and analysis of massive trajectory data has thus become an emerging and challenging task for both researchers and practitioners. Therefore, in this paper, we propose an efficient data processing framework for mining massive trajectory data. This framework includes three modules: (1) a data distribution module, (2) a data transformation module, and (3) a high performance I/O module. Specifically, we first design a two-step consistent hashing algorithm, which takes into account load balancing, data locality, and scalability, for a data distribution module. In the data transformation module, we present a parallel strategy of a linear referencing algorithm with reduced subtask coupling, easy-implemented parallelization, and low communication cost. Moreover, we propose a compression-aware I/O module to improve the processing efficiency. Finally, we conduct a comprehensive performance evaluation on a synthetic dataset (1.114 TB) and a real world taxi GPS dataset (578 GB). The experimental results demonstrate the advantages of our proposed framework.     

面向对象程序设计及其在系统仿真中的应用

基于作者的分析与理解,阐述了面向对象设计方法的特点及其为软件设计方法所带来的变革.并且在仿真系统软件的开发中,通过面向对象设计方法的应用,进一步展示了面向对象设计方法可能为软件方法学带来的进步.     

Parallelism in multigrid methods: How much is too much?

Multigrid methods are powerful techniques to accelerate the solution of computationally-intensive problems arising in a broad range of applications. Used in conjunction with iterative processes for solving partial differential equations, multigrid methods speed up iterative methods by moving the computation from the original mesh covering the problem domain through a series of coarser meshes. But this hierarchical structure leaves domain-parallel versions of the standard multigrid algorithms with a deficiency of parallelism on coarser grids. To compensate, several parallel multigrid strategies with more parallelism, but also more work, have been designed. We examine these parallel strategies and compare them to simpler standard algorithms to try to determine which techniques are more efficient and practical. We consider three parallel multigrid strategies: (1) domain-parallel versions of the standard V-cycle and F-cycle algorithms; (2) a multiple coarse grid algorithm, proposed by Fredrickson and McBryan, which generates several coarse grids for each fine grid; and (3) two Rosendale algorithm, which allow computation on all grids simultaneously. We study an elliptic model problem on simple domains, discretized with finite difference techniques on block-structured meshes in two or three dimensions with up to 10⁶ or 10⁹ points, respectively. We analyze performance using three models of parallel computation: the PRAM and two bridging models. The bridging models reflect the salient characteristics of two kinds of parallel computers: SIMD fine-grain computers, which contain a large number of small (bitserial) processors, and SPMD medium-grain computers, which have a more modest number of powerful (single chip) processors. Our analysis suggests that the standard algorithms are substantially more efficient than algorithms utilizing either parallel strategy. Both parallel strategies need too much extra work to compensate for their extra parallelism. They require a highly impractical number of processors to be competitive with simpler, standard algorithms. The analysis also suggests that the F-cycle, with the appropriate optimization techniques, is more efficient than the V-cycle under a broad range of problem, implementation, and machine characteristics, despite the fact that it exhibits even less parallelism than the V-cycle. Research at Princeton University partially supported by the National Science Foundation, Grant No. CCR-8920505, and the Office of Naval Research, Contract No. N0014-91-J-1463.     

Modeling and querying moving objects in networks

Moving objects databases have become an important research issue in recent years. For modeling and querying moving objects, there exists a comprehensive framework of abstract data types to describe objects moving freely in the 2D plane, providing data types such as moving point or moving region. However, in many applications people or vehicles move along transportation networks. It makes a lot of sense to model the network explicitly and to describe movements relative to the network rather than unconstrained space, because then it is much easier to formulate in queries relationships between moving objects and the network. Moreover, such models can be better supported in indexing and query processing. In this paper, we extend the ADT approach by modeling networks explicitly and providing data types for static and moving network positions and regions. In a highway network, example entities corresponding to these data types are motels, construction areas, cars, and traffic jams. The network model is not too simplistic; it allows one to distinguish simple roads and divided highways and to describe the possible traversals of junctions precisely. The new types and operations are integrated seamlessly into the ADT framework to achieve a relatively simple, consistent and powerful overall model and query language for constrained and unconstrained movement.     

PDM中的编码管理设计研究

在PDM中对产品相关信息统一进行编码,使信息的管理和检索更加方便,有利于CIMS各系统间的信息共享和交流,编码的高效与否在一定程度上影响着整个系统的效率。该文分析了制造业信息分类编码的特点,提出一种具有广泛包容性的编码规则基本分类,基于此提出采用面向对象技术的代码生成模型;并就不同编码系统下的代码管理提出一种解决方案。结合在具体企业的设计实例,分析了该模型的可行性。     

An Object Model of Direction and Its Implications

Direction is an important spatial concept that is used in many fields such as geographic information systems(GIS) and image interpretation. It is also frequently used as a selection condition in spatial queries. Previous work has modeled direction as a relational predicate between spatial objects. Conversely, in this paper, we model direction as a new kind of spatial object using the concepts of vectors, points and angles. The basic approach is to model direction as a unit vector. This novel view of direction has several obvious advantages: Being modeled as a spatial object, a direction object can have its own attributes and operation set. Secondly, new spatial data types such as oriented spatial objects and open spatial objects can be defined at the abstract object level. Finally, the object view of direction makes direction reasoning easy and also reduces the need for a large number of inference rules. These features are important in spatial query processing and optimization. The applicability of the direction model is demonstrated by geographic query examples.     

并行面向对象可视化开发环境的研究与实现

提出了基于并行对象的可视化开发环境,该环境充分体现了C 语言面向对象的程序设计思想和特点,将对象机制和并行机制有机结合起来,大大降低并行软件开发难度。片同时借助于可视化开发方法,用可视语法来解决实现的复杂性,使问题求解的难度进一步降低。     

基于C＋＋递归方法在应用问题中的设计与实现

递归是描述、解决应用问题的重要方法,文中结合实际例子,在面向对象开发工具C 的基础上,给出用递归方法解决应用问题的过程,对其设计思想进行分析;研究了在面向对象开发工具下,采用递归方法解决应用问题的一般方法及其应用价值,并探讨由此相关的递归程序设计技巧。