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

international symposium on High Performance distributed Computing

作者： Liang Chen K. Reddy G. Agrawal Department of Computer and Information Sciences Ohio State Uinversity Columbus OH USA

Increasingly, a number of applications rely on, or can potentially benefit from, analysis and monitoring of data streams. Moreover, many of these applications involve high volume data streams and require distributed processing of data arising from a distributed set of sources. thus, we believe that a grid environment is well suited for flexible and adaptive analysis of these streams. this paper reports the design and initial evaluation of a middleware for processing distributed data streams. Our system is referred to as GATES (grid-based adaptive execution on streams). this system is designed to use the existing grid standards and tools to the extent possible. It flexibly achieves the best accuracy that is possible while maintaining the real-time constraint on the analysis. We have developed a self-adaptation algorithm for this purpose. Results from a detailed evaluation of this system demonstrate the benefits of distributed processing, and the effectiveness of our self-adaptation algorithm.

关键词： Middleware Data analysis Application software Computerized monitoring Wide area networks Computer science Data mining Information analysis distributed processing Data engineering

来源：评论

学校读者我要写书评

暂无评论

Efficient packet scheduling using channel adaptive fair queueing in distributed mobile computing systems

引用

MOBILE NETWORKS & applications 2004年第4期9卷 297-309页

作者： Wang, L Kwok, YK Lau, WC Lau, VKN Univ Hong Kong Dept Elect & Elect Engn Hong Kong Hong Kong Peoples R China

In a distributed mobile computing system, an efficient packet scheduling policy is a crucial component to achieve a high utilization of the precious bandwidth resources while satisfying users' QoS (quality of service) demands. An important class of scheduling techniques, namely, the wireless fair queueing algorithms, have been extensively studied recently. However, a major drawback in existing approaches is that the channel model is overly simplified - a two-state channel (good or bad) is assumed. While it is relatively easy to analyze the system using such a simple model, the algorithms so designed are of a limited applicability in a practical environment, in which the level of burst errors is time-varying and can be exploited by using channel adaptive coding and modulation techniques. In this paper, we first argue that the existing algorithms cannot cater for a more realistic channel model and the traditional notion of fairness is not suitable. We then propose a new notion of fairness, which bounds the actual throughput normalized by channel capacity of any two data connections. Using the new fairness definition, we propose a new fair queueing algorithm called CAFQ (Channel Adaptive Fair Queueing), which, as indicated in our numerical studies, outperforms other algorithms in terms of overall system throughput and fairness among error prone connections.

关键词： distributed mobile computing scheduling wireless networks fair queueing fairness performance guarantees quality of service

来源：评论

学校读者我要写书评

暂无评论

Addressing, distances and routing in triangular systems with applications in cellular and sensor networks

Addressing, distances and routing in triangular systems with...

引用

Proceedings - 18th international parallel and distributed processing symposium, IPDPS 2004 (Abstracts and CD-ROM)

作者： Chepoi, Victor Dragan, Feodor Vaxès, Yann Lab. d'Info. Fond. de Marseille Universite de la Mediterranee Faculte des Sciences de Luminy F-13288 Marseille Cedex 9 France Department of Computer Science Kent State University Kent Ohio 44242 United States

ISBN: (纸本)0769521320

Triangular systems are the subgraphs of the regular triangular grid which are formed by a simple circuit of the grid and the region bounded by this circuit. they are used to model cellular networks where nodes are base stations. In this paper, we propose an addressing scheme for triangular systems by employing their isometric embeddings into the Cartesian product of three trees. this embedding provides a simple representation of any triangular system with only three small integers per vertex, and allows to employ the compact labeling schemes for trees for distance queries and routing. We show that each such system with n vertices admits a labeling that assigns O(log2 n) bit labels to vertices of the system such that the distance between any two vertices u and v can be determined in constant time by merely inspecting the labels of u and v, without using any other information about the system. Furthermore, there is a labeling, assigning labels of size O(log n) bits to vertices, which allows, given the label of a source vertex and the label of a destination, to compute in constant time the port number of the edge from the source that heads in the direction of the destination. these results are used in solving some problems in cellular networks. Our addressing and distance labeling schemes allow efficient implementation of distance and movement based tracking protocols in cellular networks, by providing information, generally not available to the user, and means for accurate cell distance determination. Our routing and distance labeling schemes provide elegant and efficient routing and connection rerouting protocols for cellular networks.

关键词： Computer networks

来源：评论

学校读者我要写书评

暂无评论

Efficient packet scheduling using channel adaptive fair queueing in distributed mobile computing systems

Efficient packet scheduling using channel adaptive fair queu...

引用

15th ieee international parallel and distributed processing symposium (IPDPS 01)

作者： Wang, L Kwok, YK Lau, WC Lau, VKN Univ Hong Kong Dept Elect & Elect Engn Hong Kong Hong Kong Peoples R China

关键词： distributed mobile computing scheduling wireless networks fair queueing fairness performance guarantees quality of service

来源：评论

学校读者我要写书评

暂无评论

Design and implementation of MPICH2 over InfiniBand with RDMA support

Design and implementation of MPICH2 over InfiniBand with RDM...

引用

Proceedings - 18th international parallel and distributed processing symposium, IPDPS 2004 (Abstracts and CD-ROM)

作者： Liu, Jiuxing Jiang, Weihang Wyckoff, Pete Panda, Dhabaleswar K. Ashton, David Buntinas, Darius Gropp, William Toonen, Brian Computer and Information Science Ohio State University Columbus OH 43210 Ohio Supercomputer Center 1224 Kinnear Road Columbus OH 43212 Mathematics Division Argonne National Laboratory Argonne IL 60439

ISBN: (纸本)0769521320

For several years, MPI has been the de facto standard for writing parallel applications. One of the most popular MPI implementations is MPICH. Its successor, MPICH2, features a completely new design that provides more performance and flexibility. To ensure portability, it has a hierarchical structure based on which porting can be done at different levels. In this paper, we present our experiences in designing and implementing MPICH2 over InfiniBand, Because of its high performance and open standard, InfiniBand is gaining popularity in the area of high-performance computing. Our study focuses on optimizing the performance of MPI-1 functions in MPICH2. One of our objectives is to exploit Remote Direct Memory Access (RDMA) in InfiniBand to achieve high performance. We have based our design on the. RDMA Channel interface provided by MPICH2, which encapsulates architecture-dependent communication functionalities into a very small set of functions. Starting with a basic design, we apply different optimizations and also propose a zero-copy-based design. We characterize the impact of our optimizations and designs using microbenchmarks. We have also performed an application-level evaluation using the NAS parallel Benchmarks. Our optimized MPICH2 implementation achieves 7.6 μs latency and 857 MB/S bandwidth, which are close to the raw performance of the underlying InfiniBand layer. Our study shows that the RDMA Channel interface in MPICH2 provides a simple, yet powerful, abstraction that enables implemen tations with high performance by exploiting RDMA operations in InfiniBand. To the best of our knowledge, this is the first high-performance design and implementation of MPICH2 on InfiniBand using RDMA support.

关键词： parallel processing systems

来源：评论

学校读者我要写书评

暂无评论

UT Grid: a comprehensive campus cyberinfrastructure 04

UT Grid: a comprehensive campus cyberinfrastructure

引用

international symposium on High Performance distributed Computing

作者： J.R. Boisseau Texas Advanced Computing Center (TACC) University of Texas Austin USA

UT Grid is a comprehensive campus cyberinfrastructure project to integrate the numerous and diverse computational, visualization, storage, data and information, and instrument/device resources of the University of Texas at Austin (UT). this joint project between UT Austin and IBM has a focus and approach with important fundamental differences from multiinstitution grids and discipline-specific grids. these distinctions, coupled with new locally-developed software for providing both portal and shell-based user interfaces to numerous grid software technologies, facilitate rapid deployment, adoption, and evolution of UT Grid, while enabling it to serve as a platform for both production computing (for research and education) and grid computing research. the first stages of UT grid are well under way after only two months: the construction of grid user portals and grid user nodes as interfaces, and the integration of serial and parallel computing resources for high-throughput computing.

关键词： Grid computing Portals Computer interfaces Data visualization Instruments User interfaces Educational technology Production Educational products parallel processing

来源：评论

学校读者我要写书评

暂无评论

A parallel hill climbing algorithm for pushing dependent data in clients-providers-servers systems

引用

MOBILE NETWORKS & applications 2004年第4期9卷 257-264页

作者： Ovalle-Martínez, FJ González, JS Stojmenovic, I Univ Nacl Autonoma Mexico IIMAS DISCA Mexico City 01000 DF Mexico Univ Ottawa SITE Ottawa ON K1N 6N5 Canada

the up-link bandwidth in satellite networks and in advanced traffic wireless information system is very limited. A server broadcasts data files provided by different independent providers and accessed by many clients in a round-robin manner. the clients who access these files may have different patterns of access. Some clients may wish to access several files in any order (AND), some wish to access one out of several files (OR), and some clients may access a second file only after accessing another file (IMPLY). the goal of the server is to order the files in a way that minimizes the access time of the clients given some a priori knowledge of their access patterns. An appropriate clients-servers model was recently proposed by Bay-Noy, Naor and Schieber. they formulated three separate problems and proposed an algorithm that evaluates certain number of random permutations and chooses the one whose access time is minimized. In this paper, we formulate a combined AOI (AND-OR-IMPLY) problem, and propose to apply a parallel hill climbing algorithm (to each of the four problems), which begins from certain number of random permutations, and then applies hill climbing technique on each of them until there is no more improvement. the evaluation time of neighboring permutations generated in hill climbing process is optimized, so that it requires O(n) time per permutation instead of O(n(2)) time required for evaluating access time of a random permutation, where n is the number of files the server broadcasts. Experiments indicate that the parallel hill climbing algorithm is O(n) times faster that random permutations method, both in terms of time needed to evaluate the same number of permutations, and time needed to provide a high quality solution. thus the improvement is significant for broadcasting large number of files.

关键词： data broadcasting hill climbing algorithms

来源：评论

学校读者我要写书评

暂无评论

A parallel hill climbing algorithm for pushing dependent data in clients-providers-servers systems

A parallel hill climbing algorithm for pushing dependent dat...

引用

15th ieee international parallel and distributed processing symposium (IPDPS 01)

作者： Ovalle-Martínez, FJ González, JS Stojmenovic, I Univ Nacl Autonoma Mexico IIMAS DISCA Mexico City 01000 DF Mexico Univ Ottawa SITE Ottawa ON K1N 6N5 Canada

关键词： data broadcasting hill climbing algorithms

来源：评论

学校读者我要写书评

暂无评论

Discouraging free riding in a peer-to-peer CPU-sharing grid 04

Discouraging free riding in a peer-to-peer CPU-sharing grid

引用

international symposium on High Performance distributed Computing

作者： N. Andrade F. Brasileiro W. Cirne M. Mowbray Departamento de Sistemas e Computação Universidade Federal de Campina Grande Campina Grande Brazil HP Labs Bristol HP Labs Bristol UK

Grid computing has excited many with the promise of access to huge amounts of resources distributed across the globe. However, there are no largely adopted solutions for automatically assembling grids, and this limits the scale of today's grids. Some argue that this is due to the overwhelming complexity of the proposed economy-based solutions. Peer-to-peer grids Iwve emerged as a less complex alternative. We are currently deploying OurGrid, one such peer-to-peer grid. OurGrid is a CPU-sharing grid that targets bag-of-tasks applications (i.e. parallel applications whose tasks are independent). In order to ease system deployment, OurGrid is based on a very lightweight autonomous reputation scheme. Free riding is an important issue for any peer-to-peer system. the aim is to show that OurGrid's reputation system successfully discourages free riding, making it in each peer s own interest to collaborate with the peer-to-peer community. We show this in two steps. First, we analyze the conditions under which a reputation scheme can discourage free riding in a CPU-sharing grid. Second, we show that OurGrid's reputation scheme satisfies these conditions, even in the presence of malicious peers. Unlike other distributed mechanisms for discouraging free riding, OurGrid's reputation scheme achieves this without requiring a shared cryptographic infrastructure or specialized storage.

关键词： Peer to peer computing Grid computing Collaboration distributed computing Cryptography Assembly Production systems Resource management Incentive schemes

来源：评论

学校读者我要写书评

暂无评论

A configurable multiprocessor and dynamic load balancing for parallel LU factorization

A configurable multiprocessor and dynamic load balancing for...

引用

international symposium on parallel and distributed processing (IPDPS)

作者： X. Wang S.G. Ziavras Department of Electrical and Computer Engineering New Jersey Institute of Technology Newark NJ USA

Summary form only given. the exponentially increasing complexity of many scientific applications and the high cost of supercomputing force us to explore new, sustainable, and affordable high-performance computing platforms. Recent significant advances in FPGA technology and the inherent advantages of configurable logic have brought about new research efforts in the configurable computing field: parallel processing on configurable chips. We explore here parallel LU factorization of large sparse block-diagonal-bordered (BDB) matrices on a configurable multiprocessor that we have designed and implemented. A dynamic load balancing strategy is proposed and analyzed. Performance results for ieee power test systems are provided. Our research provides evidence that configurable logic can be a viable alternative to high-performance scientific computing.

关键词： Load management Field programmable gate arrays Sparse matrices parallel processing Costs Concurrent computing Logic Scientific computing Equations Supercomputers

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：