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

IEEE International Conference on Communications (ICC)

作者： J.L. Marzo E. Calle C. Scoglio T. Anjali Broadband Communication and Distributed Systems Institut ďInformática i aplicacions (IiiA) Universitat de Girona Girona Spain School of Electrical and Computer Engineering Broadband and Wireless Networking Laboratory Georgia Institute of Technology Atlanta GA USA

In this paper, a method for enhancing current QoS routing methods by means of QoS protection is presented. In an MPLS network, the segments (links) to be protected are predefined and an LSP request involves, apart from establishing a working path, creating a specific type of backup path (local, reverse or global). Different QoS parameters, such as network load balancing, resource optimization and minimization of LSP request rejection should be considered. QoS protection is defined as a function of QoS parameters, such as packet loss, restoration time, and resource optimization. A framework to add QoS protection to many of the current QoS routing algorithms is introduced. A backup decision module to select the most suitable protection method is formulated and different case studies are analyzed.

关键词： Protection Multiprotocol label switching Routing Telecommunication traffic Electronic mail Fault detection Councils Contracts NASA Aerospace engineering

来源：评论

学校读者我要写书评

暂无评论

Adaptive admission control of multimedia traffic in high-speed networks

Adaptive admission control of multimedia traffic in high-spe...

引用

IEEE International Symposium on Intelligent Control (ISIC)

作者： S. Jagannathan A. Tohmaz A. Chronopoulos H.G. Cheung Embedded Systems and Networking Laboratory Department of Electrical and Computer Engineering University of Missouri Rolla MO USA Parallel and Distributed Systems Lab Department of Computer Science University of Texas-San Antonio TX USA

This paper proposes a novel real-time adaptive admission control (AAC) scheme with a desired quality of service (QoS) guarantee and high network utilization in high speed networks. The QoS is given in terms of service delay, which is defined as the time it takes for a source to get admitted into the network after it initiates its intended request, packet/cell losses, and transmission delay (time taken to complete transmission from its initiation). AAC uses the following information - the available capacity from a novel adaptive bandwidth estimation scheme, a congestion indicator derived from a congestion controller, peak cell rate estimate from new sources, along with the desired QoS metrics, and outputs an 'admit' or 'reject' decision signal to the new sources while guaranteeing QoS and network utilization. Simulation results are presented by streaming ON/OFF and video data into the network. Results show that the proposed AAC admits significantly more traffic compared to other available admission control schemes thereby guaranteeing high network utilization while maintaining the desired QoS.

关键词： Programmable control Adaptive control Admission control Communication system traffic control High-speed networks Quality of service Delay effects Propagation losses Bandwidth Streaming media

来源：评论

学校读者我要写书评

暂无评论

Exploiting Locality in Single Assignment Data Structures Updated Through Split-Phase Transactions

引用

Cluster Computing 2001年第4期4卷 281-293页

作者： Amaral, José Nelson Lin, Wen-Yen Gaudiot, Jean-Luc Gao, Guang R. Department of Computing Science University of Alberta Edmonton Canada Tia Mobile Inc. Pasadena USA Department of Electrical Engineering University of Southern California Los Angeles USA Computer Architecture and Parallel Systems Laboratory Department of Electrical and Computer Engineering University of Delaware Newark USA

We present the design, implementation, and evaluation of single assignment data structures and of a software controlled cache in an existing multi-threaded architecture platform – the Efficient Architecture for Running Threads (EARTH). The I-Structure Software-Controlled Cache (ISSC) exploits temporal and spatial locality of EARTH split-phased memory transactions for single-assignment memory references. Our experimental evaluation indicates that the caching mechanism for single-assignment storage makes the EARTH memory system more robust to variations in the latency of memory operations. As a consequence the system can be ported to a wider range of machine platforms and deliver speedup for both regular and irregular application.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Design and implementation of Automatic parallel Detection Layer

Design and implementation of Automatic Parallel Detection La...

引用

IEEE International Conference on systems, Man and Cybernetics

作者： M. Ahamed H. Eldeeb S. Nassar N. Bagherzadeh Computer Science Mathematics Department Faculty of Science Cairo University Cairo Egypt Electrical and Computer Engineering University of California Irvine Irvine CA USA Computer & Control Department Electronic Research Institute Head of Parallel and Distributed Systems team Cairo Egypt Chair of Electrical and Computer Engineering University of California Irvine Irvine CA USA

We develop a new software layer called the Automatic parallel Detection Layer (APDL) for the automatic transformation from sequential to parallel code. The main interest, in this research, is the parallelism at loop level, because significant parallelism in programs almost invariably occurs in loops. The proposed APDL has five processes for code transformation: the sequential source code parser, data dependence analysis of this code, partitioning, scheduling both task and data, and generating parallel source code. Many cases have been studied to evaluate the performance of the developed layer. The performance is evaluated depending on the execution time of: the sequential code, the parallel programmer code, and the code output from APDL for the same case study. Performance results show that APDL greatly improves the execution time with respect to sequential execution time, and saves on the high cost of a parallel programmer.

关键词： parallel processing Concurrent computing Programming profession Electronic mail Program processors distributed computing High performance computing computer science Automatic control parallel programming

来源：评论

学校读者我要写书评

暂无评论

A Java graphical user interface for large-scale scientific computations in distributed systems 4

A Java graphical user interface for large-scale scientific c...

引用

4th International Conference/Exhibition on High Performance Computing in the Asia-Pacific Region, HPC-Asia 2000

作者： Shen, X. Thiruvathukal, G. Liao, W. Choudhary, A. Singh, A. Center for Parallel and Distributed Computing Department of Electrical and Computer Engineering Northwestern University EvanstonIL60208 United States School of Computing Telecommunications and Information Sciences JHPC Laboratory DePaul University United States

ISBN: (纸本)0769505902

Large-scale scientific applications present great challenges to computational scientists in terms of obtaining high performance and in managing large datasets. These applications (most of which are simulations) may employ multiple techniques and resources in a heterogeneously distributed environment. Effective working in such an environment is crucial for modern large-scale simulations. In this paper, we present an integrated Java graphical user interface (IJ-GUI) that provides a control platform for managing complex programs and their large datasets easily. As far as performance is concerned, we present and evaluate our initial implementation of two optimization schemes: data replication and data prediction. Data replication can take advantage of 'temporal locality' by caching the remote datasets on local disks;data prediction, on the other hand, provides prefetch hints based on the datasets' past activities that are kept in databases. We first introduce the data contiguity concept in such an environment that guides data prediction. The relationship between the two approaches is discussed. © 2000 IEEE.

关键词： Forecasting

来源：评论

学校读者我要写书评

暂无评论

Data management for large‐scale scientific computations in high performance distributed systems

引用

Cluster Computing 2000年第1期3卷 45-60页

作者： Choudhary, A. Kandemir, M. No, J. Memik, G. Shen, X. Liao, W. Nagesh, H. More, S. Taylor, V. Thakur, R. Stevens, R. Center for Parallel and Distributed Computing Department of Electrical and Computer Engineering Northwestern University Evanston USA Department of Computer Science and Engineering The Pennsylvania State University University Park USA Mathematics and Computer Science Division Argonne National Laboratory Argonne USA

With the increasing number of scientific applications manipulating huge amounts of data, effective high-level data management is an increasingly important problem. Unfortunately, so far the solutions to the high‐level data management problem either require deep understanding of specific storage architectures and file layouts (as in high-performance file storage systems) or produce unsatisfactory I/O performance in exchange for ease-of-use and portability (as in relational DBMSs). In this paper we present a novel application development environment which is built around an active meta-data management system (MDMS) to handle high-level data in an effective manner. The key components of our three-tiered architecture are user application, the MDMS, and a hierarchical storage system (HSS). Our environment overcomes the performance problems of pure database-oriented solutions, while maintaining their advantages in terms of ease-of-use and portability. The high levels of performance are achieved by the MDMS, with the aid of user-specified, performance-oriented directives. Our environment supports a simple, easy-to-use yet powerful user interface, leaving the task of choosing appropriate I/O techniques for the application at hand to the MDMS. We discuss the importance of an active MDMS and show how the three components of our environment, namely the application, the MDMS, and the HSS, fit together. We also report performance numbers from our ongoing implementation and illustrate that significant improvements are made possible without undue programming effort.

关键词：

来源：评论

学校读者我要写书评

暂无评论

A scalable membership service for group communications in WANs

A scalable membership service for group communications in WA...

引用

Pacific Rim International Symposium on Dependable Computing

作者： Heejeong Kim Dongman Lee Hee Yong Youn Collaborative Distributed Systems & Networks Laboratory Information and Communications University South Korea School of Electrical & Computer Engineering Sungkyunkwan University South Korea

Group Communication System (GCS) is an important building block for reliable, fault-tolerant distributed applications. Due to highly variable and unpredictable latency in WANs, GCS needs to cope with frequent membership changes. It results in diminishing the scalability of GCS. In this paper we propose a new scheme that improves the scalability of group membership service for WANs by exploiting dedicated membership servers configured into multiple layers and reaching global agreement on the view through layered servers. It improves the scalability of a process group of N member processes from O(N/sup 2/) to O(N/sup 3/) with three layers, where N is the number of processes in the group. computer simulation verifies that the proposed scheme requires much smaller number of message exchanges for reaching an agreement on a next view and does that much quicker. In addition, the proposed scheme prevents applications from being blocked until reaching the final view agreement if the applications permit temporary inconsistency.

关键词： Wide area networks Scalability Delay Application software Web server computer networks Maintenance Intelligent networks Collaboration Laboratories

来源：评论

学校读者我要写书评

暂无评论

A novel application development environment for large-scale scientific computations 00

A novel application development environment for large-scale ...

引用

Proceedings of the 14th international conference on Supercomputing

作者： X. Shen W. Liao A. Choudhary G. Memik M. Kandemir S. More G. Thiruvathukal A. Singh Center for Parallel and Distributed Computing Department of Electrical and Computer Engineering Northwestern University Evanston IL Department of Computer Science and Engineering The Pennsylvania State University University Park PA School of Computing Telecommunications and Information Sciences JHPC Laboratory Depaul University

Our results demonstrate that our novel application development environment provides both ease-of-use and high performance for large-scale, I/O-intensive scientific applications.

ISBN: (纸本)9781581132700

Our results demonstrate that our novel application development environment provides both ease-of-use and high performance for large-scale, I/O-intensive scientific applications.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Design issues for a high-performance distributed shared memory on symmetrical multiprocessor clusters

引用

Cluster Computing 1999年第3期2卷 177-186页

作者： Roy, Sumit Chaudhary, Vipin Parallel and Distributed Computing Laboratory Department of Electrical and Computer Engineering Wayne State University Detroit USA

Clusters of Symmetrical Multiprocessors (SMPs) have recently become the norm for high-performance economical computing solutions. Multiple nodes in a cluster can be used for parallel programming using a message passing library. An alternate approach is to use a software distributed Shared Memory (DSM) to provide a view of shared memory to the application programmer. This paper describes Strings, a high performance distributed shared memory system designed for such SMP clusters. The distinguishing feature of this system is the use of a fully multi-threaded runtime system, using kernel level threads. Strings allows multiple application threads to be run on each node in a cluster. Since most modern UNIX systems can multiplex these threads on kernel level light weight processes, applications written using Strings can exploit multiple processors on a SMP machine. This paper describes some of the architectural details of the system and illustrates the performance improvements with benchmark programs from the SPLASH-2 suite, some computational kernels as well as a full fledged application. It is found that using multiple processes on SMP nodes provides good speedups only for a few of the programs. Multiple application threads can improve the performance in some cases, but other programs show a slowdown. If kernel threads are used additionally, the overall performance improves significantly in all programs tested. Other design decisions also have a beneficial impact, though to a lesser degree.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Cooperative caching in append-only databases with hot spots

Cooperative caching in append-only databases with hot spots

引用

International Conference on Data engineering

作者： A. Sinha C. Chase M. Cochinwala Parallel and Distributed Systems Laboratory Electrical and Computer Engineering University of Texas Austin USA Bellcore Morristown NJ USA

We measure the performance of several cooperative caching policies for a database with hot spots. The workload consists of queries and append-only update transactions, and is modeled after a financial database of stock (historical) trading information. We show that cooperative caching is effective for this application. We show that selecting the correct set of peer servers when servicing a cache miss is crucial to achieving high performance, and we demonstrate a greedy algorithm that performs close to optimal for this workload. We also evaluate several cache replacement policies and show that a 2nd-chance algorithm performs best. In a 2nd-chance algorithm, replaced pages are transferred to a peer server rather than being discarded. When a page is selected for replacement a 2nd time, the page is discarded. Our results can be applied in the design of proxy servers for databases or Web servers where a layer of proxy servers are used to scale the system performance.

关键词： Cooperative caching Databases Laboratories Electric variables measurement Page description languages Bandwidth Broadcasting

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：