检索结果-内蒙古大学图书馆

1995 Heterogeneous Computing Workshop, HCW 1994

作者： Watson, Daniel W. Antonio, John K. Siegel, Howard Jay Atallah, Mikhail J. Department of Computer Science Utah State University LoganUT84321-4205 United States Parallel Processing Laboratory School of Electrical Engineering Purdue University West LafayetteIN47907-1285 United States Computer Sciences Department Purdue University West LafayetteIN47907-1398 United States

ISBN: (纸本)0818655925

The problem of minimizing the execution time of programs within a heterogeneous environment is considered. Different computational characteristics within a parallel algorithm may make switching execution from one machine to another beneficial;however, the cost of switching between machines during the execution of a program must be considered. This cost is not constant, but depends on data transfers needed as a result of the move. Therefore, determining a minimum-cost assignment of machines to program segments is not straightforward. A previously presented Block-Based Mode Selection (BBMS) approach is used as a basis to develop a heuristic method for assigning machines to program segments of data-parallel algorithms. Simulation results of parallel program behavior using the heuristic indicate that good assignments are possible without resorting to exhaustive search techniques. © 1994 IEEE.

关键词： Heuristic methods

来源：评论

学校读者我要写书评

暂无评论

Hardware support for the Seamless programming model

Hardware support for the Seamless programming model

引用

Frontiers of Massively parallel Computation

作者： S.A. Fineberg T.L. Casavant B.H. Pease Computer Science Corporation USA Parallel Processing Laboratory Department of Electrical and Computer Engineering University of Iowa Iowa IA USA

The communication latency problem is presented with special emphasis on RISC (reduced instruction set computer) based multiprocessors. An interprocessor communication model for parallel programs based on locality is presented. This model enables the programmer to manipulate locality at the language level and to take advantage of currently available system hardware to reduce latency. A hardware node architecture for a latency-tolerant RISC-based multiprocessor, called Seamless, that supports this model, is presented. The Seamless architecture includes the addition of a hardware locality manager to each processing element, as well as an integral runtime environment and compiler.< >

关键词： Hardware Delay Yarn parallel processing Reduced instruction set computing Costs Coprocessors Communication system control parallel architectures Synchronization

来源：评论

学校读者我要写书评

暂无评论

A distributed management scheme for partitionable parallel computers

引用

IEEE Transactions on parallel and Distributed Systems 1990年第1期1卷 120-126页

作者： M. Jeng H.J. Siegel Computer Science Department University of Houston Houston TX USA Parallel Processing Laboratory School of Electrical Engineering Purdue University West Lafayette IN USA

A distributed scheme for dynamic partitioning is investigated. Distributed procedures to split a subsystem and to combine subsystems are presented. The correctness of each of these two procedures is shown, and the complexity is analyzed. The procedures are applicable to parallel computers that use interconnection networks, such as hypercube, omega, multistage cube, and extra-stage cube networks.< >

关键词： Concurrent computing Distributed computing Multiprocessor interconnection networks computer networks parallel processing Application software Hypercubes Intelligent networks Resource management Large-scale systems

来源：评论

学校读者我要写书评

暂无评论

A framework for compile-time selection of parallel modes in an SIMD/SPMD heterogeneous environment 7

A framework for compile-time selection of parallel modes in ...

引用

1993 Workshop on Heterogeneous processing, VVHP 1993, Held in conjunction with the 7th International parallel processing Symposium

作者： Watson, Daniel W. Siegel, Howard Jay Antonio, John K. Nichols, Mark A. Atallah, Mikhail J. Parallel Processing Laboratory School of Electrical Engineering Purdue University West LafayetteIN47907 United States Computer Sciences Department Purdue University West LafayetteIN47907 United States NCR Corp. San DiegoCA United States

ISBN: (纸本)0818635312

A framework for estimating the relative execution time of a data-parallel algorithm in an environment capable of the SIMD and SPMD (Single Program - Multiple Data) modes of computation is presented. Given a data-parallel program in a language whose syntax is mode-independent, and empirical information about instruction execution time characteristics, the long-term goal is to determine at compile time an implementation that results in an optimal execution time for a heterogeneous system capable of SIMD and SPMD parallelism. © 1993 IEEE.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Efficient masking techniques for large-scale SIMD architectures

Efficient masking techniques for large-scale SIMD architectu...

引用

Frontiers of Massively parallel Computation

作者： W.G. Nation S.A. Fineberg M.D. Allemang T. Schwederski T.L. Casavant H.J. Siegel Parallel Processing Laboratory School of Electrical Engineering Purdue University West Lafayette IN USA Parallel Processing Laboratory Department of Electrical and Computer Engineering University of Iowa Iowa IA USA Institute for Microelectronics Stuttgart Stuttgart Germany

SIMD (single-instruction-stream, multiple-data-stream) architectures require mechanisms that efficiently enable and disable mask processors to support flexible programming. Most current SIMD architectures use local masking. Global processor masks, specified by the control unit, are more efficient for tasks where the masking is data independent. An efficient hybrid masking technique that supports global masking, as well as local masking, for SIMD architectures constructed from standard microprocessors is proposed. A design for the hybrid mechanism is described, and its experimental performance using the existing PASM prototype is examined. It is shown that the hybrid masking technique can increase the utilization of PEs and thus increase performance, the degree of improvement being algorithm dependent.< >

关键词： Large-scale systems parallel processing Microprocessors Laboratories Concurrent computing computer architecture Prototypes Microelectronics Cities and towns parallel programming

来源：评论

学校读者我要写书评

暂无评论

A multicast protocol for mobile ad hoc networks using location information

A multicast protocol for mobile ad hoc networks using locati...

引用

Workshop on Applications and Services in Wireless Networks, ASWN

作者： H. Ammari H. El-Rewini Mobile Computing and Parallel Processing Laboratory Computer Science and Engineering Department School of Engineering Southern Methodist University Dallas TX USA

Multicasting is a one-to-many process by wbich a node can send the same packet to a subset of nodes, called multicast group, which have already registered to the same multicast group address. The goal of this paper is to propose a multicast algorithm for mobile ad hoc networks using location information, where a multicast group is definro with respect to a specific network space area, called millticost domain. A mohile ad hoc network (MANET) is a set of nodes that agrero upon fonning a spontaneous, temporar y network so that they can communicate over wireless Iinks despite the lack of any centraIized administration and any fonn or infrastructure. The proposed algorithm benefits from the location-oriented service offered by a glohal positioning system (GPS), which provides MANET nodes (or nodes for short) with their location information when needed. Moreover, the protocol makes use of the Vorono; diagram properties in order to multicast a packet in a selective manner towards its target multicast dOmain, where ouly a small subset of nodes is involved in the forwarding process. These nodes, called authorized forwarders, are identified from the *** Voronoi graph that a multicast source node or an authorized forwarder constructs based on the location infonnation of its neighborhood as well as the target multicast domain. The analysis bas shown that fhe protocol helps minimize the transmission overhead, which would be caused during the forwarding of a multicast packet, while guaranteeing convergence and correctness. Compared to other existing location-based multicast protocols, the proposed one yields more reduction of transmission overhead and perfonns correctly even with particular MANET topologies. Keywords - Multicasting, mobile ad hoc networks, locationbased service, Voronoi diagmms, global positioning system.

关键词： Multicast protocols Mobile ad hoc networks Routing protocols Multicast algorithms Network topology Mobile computing computer networks Concurrent computing parallel processing Laboratories

来源：评论

学校读者我要写书评

暂无评论

Low-power CDMA multiuser receiver architectures

Low-power CDMA multiuser receiver architectures

引用

IEEE Workshop on Signal processing Systems (SIPS)

作者： Tao Long N.R. Shanbhag VLSI Information Processing Systems (VIPs) Group Coordinated Science LaboratoryElectrical and Computer Engineering Department University of Illinois Urbana-Champaign Urbana IL USA

Presented in this paper are low-power, reconfigurable adaptive CDMA multiuser receiver architectures developed via dynamic algorithmic transforms (DAT). The architectures achieve low-power operation via run-time reconfiguration of receiver complexity to match the requirements of a time-varying multiuser channel. Simulation results with 0.25 /spl mu/m, 2.3 V CMOS technology parameters indicate that the proposed architectures have high resistance to the near-far problem, and can achieve up to 60.4% in power savings compared to architectures without DAT depending on the interference situation.

关键词： Multiaccess communication Multiuser detection computer architecture Heuristic algorithms Detectors Throughput CMOS technology Multimedia systems Multiple access interference Hardware

来源：评论

学校读者我要写书评

暂无评论

Using hybrid selection schemes to support QoS when providing multihop wireless Internet access to mobile ad hoc networks

Using hybrid selection schemes to support QoS when providing...

引用

International Conference on Quality of Service in Heterogeneous Wired/Wireless Networks (QSHINE)

作者： H. Ammari H. El-Rewini Mobile Computing and Parallel Processing Laboratory Computer Science and Engineering Department Southern Methodist University Dallas TX USA

The quality of service (QoS) of wireless Internet access that could be provided to multihop wireless networks, so-called mobile ad hoc networks (MANETs), is highly dependent on the quality of the design of the intermediate facility that will integrate MANET and the Internet. This facility is equipped with a hybrid mechanism being able to fulfill the working requirements of MANET and the Internet so that it can connect to either one of these orthogonal network architectures. The architecture that we propose in order to provide MANET nodes with Internet access utilizes fixed gateways (or access points) and exploits the mobility capability of additional mobile ones. Since Internet access to MANET nodes is provided through mobile gateways, the quality of such service depends on the selection procedure used by MANET nodes to choose the most convenient mobile gateways and register with. In this paper, we suggest to use a hybrid criterion based on the weighted sum of the Euclidean distance between MANET nodes and mobile gateways, and the load of mobile gateways, defined as the number of MANET nodes currently registered with them. Moreover, the sum of the weights is normalized to one, where each weight measures the level of interest of the corresponding criterion in the hybrid one. Simulation results show that the hybrid criterion has an impact on the quality of wireless Internet access service depending on the level of interest assigned to each of the Euclidean distance and load criteria in the weighted sum.

关键词： Spread spectrum communication IP networks Mobile ad hoc networks Quality of service Web and internet services Routing protocols Euclidean distance Access protocols Mobile computing computer networks

来源：评论

学校读者我要写书评

暂无评论

A location information-based route discovery protocol for mobile ad hoc networks

A location information-based route discovery protocol for mo...

引用

IEEE International Conference on Performance, Computing and Communications (IPCCC)

作者： H. Ammari H. El-Rewini Mobile Computing and Parallel Processing Lab Computer Science and Engineering Department School of Engineering Southern Methodist University Dallas TX USA

A mobile ad hoc network (MANET) is a set of mobile nodes that agreed upon forming a temporary, spontaneous network in spite of the lack of any infrastructure or centralized administration. MANET topology changes frequently and arbitrarily due to node mobility. Therefore, an efficient routing protocol is required to cope with the dynamic change of MANET topology, which requires discovering and maintaining new routes, in this paper we propose a route discovery protocol based on location information, which could be provided to MANET nodes by a Global Positioning System (GPS). Our route discovery protocol utilizes the essential features of Voronoi diagrams in order to reduce the search space of routes by allowing only a small subset of MANET nodes, called authorized forwarders, to forward a route request. This results in a restrictive, selective route discovery protocol, which significantly reduces the routing overhead compared to other location-based routing protocol, such as LAR.

关键词： Mobile ad hoc networks Routing protocols Mobile computing Global Positioning System Concurrent computing parallel processing computer science Network topology Costs Bandwidth

来源：评论

学校读者我要写书评

暂无评论

Context-Aware Scheduling in Wireless Networks with Successive Interference Cancellation

Context-Aware Scheduling in Wireless Networks with Successiv...

引用

IEEE International Conference on Communications Workshops

作者： Shaohe Lv Weihua Zhuang Xiaodong Wang Xingming Zhou National Laboratory of Parallel and Distributed Processing National University of Defense Technology Department of Electrical and Computer Engineering University of Waterloo

ISBN: (纸本)9781612842325

We consider the greedy scheduling based on the physical model in wireless networks with successive interference cancellation (SIC). There are two major stages in a scheduling scheme, link selection (to decide which link is scheduled next) and time slot selection (to deciding which slot is allocated to a given link). Most available schemes take a first-fit policy in the latter and strive to achieve good performance by careful selection of link ordering with respect to interference. Due to the accumulation effect and sequential detection nature of SIC, however, it is difficult to evaluate the interference of a link. As a result, many existing scheduling schemes become less efficient. In this paper, we take a new look on the problem and focus to the time slot selection stage. We define tolerance margin to measure the saturation of a link set and present two heuristic policies: one is to schedule a link to a slot such that the resulting set of links has a maximum tolerance margin;the other is to choose a slot such that the increase of tolerance margin is minimum. Simulation results show that the performance of the proposed schemes is better than the first-fit policy and is close to the optimal solution.

关键词： Link scheduling Successive interference cancellation Physical interference model

来源：评论

学校读者我要写书评

暂无评论

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

建议与咨询 留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案： 新增检索档案 确定 取消

请选择收藏分类： 新增自定义分类 确定 取消

通借通还

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

请选择保存的检索档案：

请选择收藏分类：