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

IEEE International Conference on Algorithms and Architectures for parallel Processing (ICAP)

作者： Oh-Young Kwon Tae-Geun Kim Tack-Don Han Sung-Bong Yang Shin-Dug Kim Distributed Computing Laboratory Systems Engineering Research Institute Taejon South Korea Parallel Processing System Laboratory Department of Computer Science Yonsei University Seoul South Korea

ISBN: (纸本)0780342291

In order to generate local addresses for an array section A(l:h:s) with block-cyclic distribution, an efficient compiling method is required. In this paper, two local address generation methods for the block-cyclic distribution are presented. One is a simple local address generation method that is modified from the virtual-block scheme. The other is a linear-time /spl Delta/M table construction method. The array elements of A(l:h:s) to be accessed at run-time build up a family of lines. By using the equation of the lines, a /spl Delta/M table can be generated in O(k) time. Experimental results show that a simple local address generation method has poor performance but a linear-time /spl Delta/M table generation method is faster than other algorithms in /spl Delta/M table generation time and access time for 10,000 array elements.

关键词： Runtime Equations distributed computing systems engineering and theory parallel processing Laboratories computer science parallel languages Upper bound Automata

来源：评论

学校读者我要写书评

暂无评论

A critique of java for concurrent programming

引用

IEEE distributed systems Online 2005年第9期6卷

作者： Garg, Vijay K. Mittal, Neeraj University of Texas Austin University of Texas Dallas Electrical and Computer Engineering Department University of Texas Austin University's Parallel Distributed Systems Laboratory Department of Computer Science University of Texas Dallas

A comparative study between Java and Avaj, a concurrent programming language, is presented. java uses wait (), notify (), and notifyAll () construct to support monitors, while Avaj simply supports the construct await (B), where B is any Boolean expression. The syntax for the Avaj abort () construct is simple and allows programmer to call abort () inside any method. Avaj also incorporates the selective communication construct in the language. The invariant (B) construct in Avaj allows a Boolean expression to be invariant in a program.

关键词： Java programming language

来源：评论

学校读者我要写书评

暂无评论

ANCAEE: A Novel Clustering Algorithm for Energy Efficiency in Wireless Sensor Networks

引用

Wireless Sensor Network 2011年第9期3卷 307-312页

作者： A. P. Abidoye N. A. Azeez A. O. Adesina K. K. Agbele Wireless Sensor Networks & Natural Language Research Group Grid Computing & Distributed Systems Laboratory Department of Computer Science University of the Western Cape

One of the major constraints of wireless sensor networks is limited energy available to sensor nodes because of the small size of the batteries they use as source of power. Clustering is one of the routing techniques that have been using to minimize sensor nodes’ energy consumption during operation. In this paper, A Novel Clustering Algorithm for Energy Efficiency in Wireless Sensor Networks (ANCAEE) has been proposed. The algorithm achieves good performance in terms of minimizing energy consumption during data transmission and energy consumptions are distributed uniformly among all nodes. ANCAEE uses a new method of clusters formation and election of cluster heads. The algorithm ensures that a node transmits its data to the cluster head with a single hop transmission and cluster heads forward their data to the base station with multi-hop transmissions. simulation results show that our approach consumes less energy and effectively extends network utilization.

关键词： Sensor Nodes Clusters Cluster heads Wireless Sensor Networks Base Station Clustering Algorithms Energy Efficiency

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

Down to Earth - How to Visualize Traffic on High-dimensional Torus Networks

Down to Earth - How to Visualize Traffic on High-dimensional...

引用

Workshop on Visual Performance Analysis (VPA)

作者： Lucas Theisen Aamer Shah Felix Wolf Department of Computer Science RWTH Aachen University Aachen Germany German Research School for Simulation Sciences Laboratory for Parallel Programming Aachen Germany

High-dimensional torus networks are becoming common in flagship HPC systems, with five of the top ten systems in June 2014 having networks with more than three dimensions. Although such networks combine performance with scalability at reasonable cost, the challenge of how to achieve optimal performance remains. Tools are needed to help understand how well the traffic is distributed among the many dimensions. This involves not only capturing network traffic but also its comprehensible visualization. However, visualizing such networks requires projecting multiple dimensions onto a two-dimensional screen, which is naturally challenging. To tackle this problem, in this position paper, we propose a visualization technique which can display traffic on torus networks with up to six dimensions. Our fundamental approach is to simultaneously present multiple views of the same network section, with each view visualizing different dimensions. Furthermore, we leverage the multiple-coordinate system concept and combine it with a customized polygon view to provide both a global and a zoomed-in perspective of the network. By interactively linking all the views, our technique makes it possible to analyze how the communication pattern of an application is mapped onto a network.

关键词： Data visualization Visualization Monitoring Measurement Educational institutions Joining processes Hardware

来源：评论

学校读者我要写书评

暂无评论

The prototype of continuous media file system, CrownFS

The prototype of continuous media file system, CrownFS

引用

International Conference on Information Networking

作者： Se-Jin Hwang Jin-Uok Kim Myong-Soon Park Oh-Young Kwon Tae-Geun Kim Computer Systems Laboratory Computer Science Department Korea University Seoul South Korea Distributed Computing Laboratory Network Computing Department Systems Engineering Research Institute Daejeon South Korea

ISBN: (纸本)0818672250

Currently, many multimedia or continuous media server system is under development on top of either workstations or high-end PCs clustered with high speed networking facilities. In this paper we introduce Crown, a continuous media server on clustered high performance PCs with Myrinet, fast network switching equipment, and then address CrownFS, a file system on top of Crown, to offer continuous media streams to many subscribers at the same time. For easy and rapid tuning of the performance of CrownFS, we prototyped it. Prototyping requires less efforts and costs than direct implementation. Also, more reliable system optimization is obtainable rather than simulation. By using the prototype, we measured the scalability of CrownFS according to disk access strategies.

关键词： Prototypes File systems Streaming media Network servers Personal communication networks Multimedia systems Workstations High-speed networks File servers Costs

来源：评论

学校读者我要写书评

暂无评论

Polyjuice: High-performance transactions via learned concurrency control

arXiv

引用

arXiv 2021年

作者： Wang, Jiachen Ding, Ding Wang, Huan Christensen, Conrad Wang, Zhaoguo Chen, Haibo Li, Jinyang Institute of Parallel and Distributed Systems Shanghai Jiao Tong University China Shanghai AI Laboratory China Engineering Research Center for Domain-specific Operating Systems Ministry of Education China Department of Computer Science New York University

Concurrency control algorithms are key determinants of the performance of in-memory databases. Existing algorithms are designed to work well for certain workloads. For example, optimistic concurrency control (OCC) is better than twophase- locking (2PL) under low contention, while the converse is true under high contention. To adapt to different workloads, prior works mix or switch between a few known algorithms using manual insights or simple heuristics. We propose a learning-based framework that instead explicitly optimizes concurrency control via offline training to maximize performance. Instead of choosing among a small number of known algorithms, our approach searches in a "policy space" of fine-grained actions, resulting in novel algorithms that can outperform existing algorithms by specializing to a given workload. We build Polyjuice based on our learning framework and evaluate it against several existing algorithms. Under different configurations of TPC-C and TPC-E, Polyjuice can achieve throughput numbers higher than the best of existing algorithms by 15% to 56%. Copyright © 2021, The Authors. All rights reserved.

关键词： Concurrency control

来源：评论

学校读者我要写书评

暂无评论

Checkpointing distributed application running on mobile ad hoc networks

Checkpointing distributed application running on mobile ad h...

引用

International Journal of High Performance Computing and Networking

作者： Mansouri, Houssem Badache, Nadjib Aliouat, Makhlouf Pathan, Al-Sakib Khan Department of Computer Science Faculty of Exact Sciences University of Bejaia Bejaia06000 Algeria Research Center on Scientific and Technical Information CERIST Ben-Aknoun Algiers16000 Algeria Laboratory of Networks and Distributed Systems Computer Science Department University of Ferhat Abbas S?tif1 S?tif19000 Algeria Faculty of Computer and Information Systems Islamic University in Madinah Madinah al-Munawwarah Saudi Arabia CSE Department University of Asia Pacific Bangladesh

Mobile ad hoc network (MANET) is a type of wireless network consisting of a set of self-configured mobile hosts that can communicate with each other using wireless links without the assistance of any fixed infrastructure. This has made it possible for us to create distributed mobile computing applications and has also brought several new challenges in the field of distributed algorithm design. Checkpointing is a well explored fault tolerance technique for the wired and cellular mobile networks. However, it is not directly applicable to MANET owing to its dynamic topology, limited availability of stable storage, partitioning and the absence of fixed infrastructure. In this paper, we propose an adaptive, coordinated and non-blocking checkpointing algorithm to provide fault tolerance in cluster-based MANET, where only a minimum number of mobile hosts in the cluster should take checkpoints. The performance analysis and simulation results show that the proposed scheme requires less coordinating-message cost and performs well compared to the related previous works. Copyright ? 2018 Inderscience Enterprises Ltd.

关键词： Mobile ad hoc networks distributed computer systems Fault tolerance Mobile computing Cellular mobile networks Check pointing Clustering distributed mobile computing Fault tolerance techniques MANET Non blocking checkpointing Performance analysis and simulation

来源：评论

学校读者我要写书评

暂无评论

Synchronizing the timestamps of concurrent events in traces of hybrid MPI/OpenMP applications

Synchronizing the timestamps of concurrent events in traces ...

引用

作者： Becker, Daniel Geimer, Markus Rabenseifner, Rolf Wolf, Felix German Research School for Simulation Sciences Laboratory for Parallel Programming 52062 Aachen Germany RWTH Aachen University Department of Computer Science 52056 Aachen Germany Forschungszentrum Jülich Jülich Supercomputing Centre 52428 Jülich Germany University of Stuttgart High Performance Computing-Center 70550 Stuttgart Germany

ISBN: (纸本)9780769542201

Event traces are helpful in understanding the performance behavior of parallel applications since they allow the indepth analysis of communication and synchronization patterns. However, the absence of synchronized clocks on most cluster systems may render the analysis ineffective because inaccurate relative event timings may misrepresent the logical event order and lead to errors when quantifying the impact of certain behaviors or confuse the users of time-line visualization tools by showing messages flowing backward in time. In our earlier work, we have developed a scalable algorithm that eliminates inconsistent inter-process timings postmortem in traces of pure MPI applications. Since hybrid programming, the combination of MPI and OpenMP in a single application, is becoming more popular on clusters in response to rising numbers of cores per chip and widening shared-memory nodes, we present an extended version of the algorithm that in addition to message-passing event semantics also preserves and restores shared-memory event semantics. © 2010 IEEE.

关键词： Message passing

来源：评论

学校读者我要写书评

暂无评论

A data placement strategy on MZR for VOD servers

A data placement strategy on MZR for VOD servers

引用

International Conference on parallel and distributed systems (ICPADS)

作者： Jeong-Won Kim Hyoung-Roung Lim Young-Ju Kim Ki-Dong Chung Parallel Multimedia Laboratory Department of Computer Science Pusan National University South Korea Systems Engineering Research Institute Taejon South Korea

ISBN: (纸本)0818682272

The number of concurrent users in VOD servers mainly depend on the disk placement strategies of video blocks. Especially, the storage server should make the most of MZR (multi-zone recording) disks' characteristics. The variable transfer rates and capacity in zones feature the MZR disk, so the outward zones have more transfer rates and capacity than inward zones. Also, Users' access patterns concentrate on the popular videos. So, if the popular video blocks are placed at the outward zones, the number of concurrent users can be increased. In this paper we present the popularity-based variable way placement strategy for disk groups (PVW) based on the LP and the SHP. The PVW aims to effectively support popular streams of high access rates without additional storage capacity. The more popular video blocks are to be placed in all disk groups to utilize the total bandwidth of a storage subsystem, and the less popular video blocks are to be placed in the small disk groups. By the simulation study, we have found that more users could be supported by this strategy.

关键词： Bandwidth Space technology Video on demand Videoconference Hard disks Disk recording Video recording computer science systems engineering and theory Tiles

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：