An efficient scheme is presented for embedding a complete binary tree architecture in a two-dimensional array of processing elements. the scheme utilizes almost 100% of the processing elements in the array as actual c...
详细信息
An efficient scheme is presented for embedding a complete binary tree architecture in a two-dimensional array of processing elements. the scheme utilizes almost 100% of the processing elements in the array as actual computing elements, with small and asymptotically optimal propagation delay. the maximum edge length is optimal for trees with up to six levels. the scheme is compared with other designs proposed in the literature and shown to be significantly better.< >
In this paper, following results are obtained :1.N numbers of m bits can be added in time O(lg N/lg(lg N)+lg m) with O(m*N1−(c/lglg N))*(lglg N/lg2N) + (N*lglg N/lg N) ) processors. Here, c is some pre-assigned consta...
详细信息
Various communication aspects of locally distributed database processing are studied, using some distributed sorting and distributed hash-based join algorithms as examples. the algorithms are implemented on diskless w...
详细信息
Various communication aspects of locally distributed database processing are studied, using some distributed sorting and distributed hash-based join algorithms as examples. the algorithms are implemented on diskless workstations connected by an Ethernet network to simulate a distributed main memory system environment. this experimental testbed is described. Raw communication performance data (i.e. memory-to-memory data transfer timing) are presented. the effects of the underlying distributed operating system and the speed of the processor on the communication performance are shown. Two distributed sorting algorithms are used as examples to study the issue of concurrent transmissions of messages. Distributed hash join is used as a case study for communication/local-processing tradeoff. the idea of load sharing among a number of sites to speed up the join operation is introduced.< >
A novel graph-theoretic model for describing the relation between a decomposed algorithm and its execution in a multiprocessor environment is developed. Called ATAMM, the model consists of a set of Petri-net marked gr...
详细信息
A novel graph-theoretic model for describing the relation between a decomposed algorithm and its execution in a multiprocessor environment is developed. Called ATAMM, the model consists of a set of Petri-net marked graphs that incorporates the general specifications of a data-flow architecture. the model is useful for representing decision-free algorithms having large-grained, computationally complex primitive operations. Performance measures of computing speed and throughput capacity are defined. the ATAMM model is used to develop analytically lower bounds for these parameters.< >
the design and implementation of a high-speed access mechanism for a fiber-optic multiservice LAN is presented. the handling of stream-type and burst-type communications is accomplished through the use of a distribute...
详细信息
the design and implementation of a high-speed access mechanism for a fiber-optic multiservice LAN is presented. the handling of stream-type and burst-type communications is accomplished through the use of a distributed hybrid switching protocol that uses an asynchronous dynamic time-division-multiplexing technique. the network comprises a write channel in which each network node transmits and a read channel where the transmitted information is duplicated and thus received by the network nodes. In parallel withthe write channel, a sense channel is responsible for detecting the right of access for the node. the protocol provides bounded delay for the packet-switched traffic and small buffering memory for the circuit-switched traffic, which together withthe network bit rate and the node processing time and capacity set the network efficiency. Experimental results are presented for the node processing time and the network speed.< >
the real-time facilities of existing local area networks (LANs) which primarily address the needs of non-real-time data traffic are reviewed. An architecture called Instanet is introduced to support the needs of distr...
详细信息
the real-time facilities of existing local area networks (LANs) which primarily address the needs of non-real-time data traffic are reviewed. An architecture called Instanet is introduced to support the needs of distributed real-time systems. Instanet incorporates a logically separate channel to arbitrate on the access rights of different priorities of traffic. An overview of the Instanet architecture is given, and analytical and simulation results of its performance under different traffic loadings are presented.< >
A novel approach to allocating and sharing communication and computational resources in a distributed system is described. the approach, which is based on concepts drawn from microeconomics, uses algorithms that are c...
详细信息
A novel approach to allocating and sharing communication and computational resources in a distributed system is described. the approach, which is based on concepts drawn from microeconomics, uses algorithms that are competitive rather than cooperative. the effectiveness of these concepts is demonstrated by describing an economy that improves the performance of a distributed system by implementing load balancing. In this economy, competition sets prices for the resources in the system. Jobs complete for the resources by issuing bids, and the resource allocation decisions are made through auctions held by the processors. the benefits of the method include limited complexity and algorithms that are intrinsically decentralized and modular. Simulation studies show that these economies achieve substantial performance benefits.< >
Systems that have the capability of executing tasks with various sizes and computation structures simultaneously are considered. When some of the tasks are completed, part of the system becomes idle and is reconfigure...
详细信息
Systems that have the capability of executing tasks with various sizes and computation structures simultaneously are considered. When some of the tasks are completed, part of the system becomes idle and is reconfigured for new tasks. Inappropriate reconfiguration strategies can create resource fragments and result in a loss of computation power. this problem can be alleviated by partitioning the system dynamically. Partitioning consists of two processes: splitting the system or a subsystem into smaller subsystems, and combining unallocated subsystems into larger subsystems. these two processes are investigated analytically for a lattice model that uses a special partial ordering relation on a set. the complexities of these two processes are also analyzed. the method can be applied to any system that can be modeled by a lattice.< >
this paper describes an image processing simulation algorithm to detect a partly hidden and variously appearing screw hole, applied for a screw-tightening robot with vision in the industrial assembly lines of a steel ...
详细信息
ISBN:
(纸本)0948507152
this paper describes an image processing simulation algorithm to detect a partly hidden and variously appearing screw hole, applied for a screw-tightening robot with vision in the industrial assembly lines of a steel cabinet door. In this algorithm, the information of the structure of the hole leads, step by step, to the recognition. the image from an ITV camera is smoothed and differentiated. At each step, the emphasizing method is selected according to the shape of each object. For this purpose, a line-enhancement technique and an improvement of threshold selection method are suggested.
暂无评论