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

International Symposium on parallel and distributed Processing (IPDPS)

作者： S. Ponnuswamy V. Chaudhary Parallel and Distributed Computing Laboratory Department of Electrical and Computer Engineering Wayne State University Detroit MI USA

Symmetric directed Cayley graphs called rotator graphs have been proposed recently in the literature. In addition to a lower diameter and average distance compared to the star graph, hypercube, and k-ary n-cubes, these rotator graphs also have a rich cyclic structure. We identify a variety of disjoint cycles in rotator graphs. An efficient algorithm for Hamiltonian cycles in rotator graphs is presented. This algorithm uses a basic sequence of four generators repeatedly with generators of higher order in between, to obtain Hamiltonian cycle in any n-rotator graph. We study the embedding of undirected cycles and directed cycles in rotator graphs. We also prove that the incomplete rotator graph obtained from the rotator graph is Hamiltonian. The embedding of undirected rings in rotator graphs is shown to have a low average dilation.< >

关键词： Multiprocessor interconnection networks distributed computing parallel processing Algorithm design and analysis Laboratories Concurrent computing Hypercubes Optical fiber communication Very large scale integration Protocols

来源：评论

学校读者我要写书评

暂无评论

Strings: a high-performance distributed shared memory for symmetrical multiprocessor clusters 98

Strings: a high-performance distributed shared memory for sy...

引用

International Symposium on High Performance distributed Computing

作者： S. Roy V. Chaudhary Parallel and Distributed Computing Laboratory Department of Electrical and Computer Engineering Wayne State University Detroit MI USA

ISBN: (纸本)9780818685798

Introduces Strings, a high-performance distributed shared memory system designed for clusters of symmetrical multiprocessors (SMPs). The distinguishing feature of this system is the use of a fully multithreaded runtime system, written using POSIX threads. Strings also 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 lightweight processes, applications written using Strings can use all the processors in a SMP machine. This paper describes some of the architectural details of the system and analyzes the performance improvements with two example programs and a few benchmark programs from the SPLASH-2 suite.

关键词： Programming profession Yarn Microprocessors Workstations Sun Concurrent computing Laboratories Fuels Oceans Drugs

来源：评论

学校读者我要写书评

暂无评论

Mapping algorithms for permutation networks

Mapping algorithms for permutation networks

引用

Midwest Symposium on Circuits and systems (MWSCAS)

作者： V. Chaudhary Parallel and Distributed Computing Laboratory Department of Electrical and Computer Engineering Wayne State University Detroit MI USA

The mapping problem arises when the dependency structure of a parallel algorithm differs from the interconnection of processors in the intended parallel computer (topological variation) or, when the number of processes required by the algorithm exceeds the number of processors available in the computer (cardinality variation). The problem discussed in this paper is to identify a distributed computing environment that best optimizes the objective function for the given problem. Distinct network permutations may result in equivalent process permutation depending upon the mapping of processes onto the processors. In this paper we study the permuting properties of dynamic interconnection networks taking process mapping into consideration. A uniform group theoretic representation for interconnection networks is developed. Finally, an algorithm to evaluate the number of passes required by an interconnection network to realize a given mapping is presented.< >

关键词： Multiprocessor interconnection networks distributed computing Concurrent computing parallel algorithms Multiprocessing systems Laboratories Costs Delay effects Routing

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

Contention sensitive fault-tolerant routing algorithms for hypercubes

Contention sensitive fault-tolerant routing algorithms for h...

引用

International Symposium on parallel Architectures, Algorithms and Networks (ISPAN)

作者： R. Srinivasan V. Chaudhary S.M. Mahmud Parallel and Distributed Computing Laboratory Department of Electrical and Computer Engineering Wayne State University Detroit MI USA

We present two new fault tolerant routing algorithms for hypercubes. The first algorithm requires only local knowledge of the faults whereas the second algorithm requires global knowledge. Unlike previous fault tolerant routing algorithms, our algorithms take into consideration the dynamic conditions (link contention) of the network. We have shown that checking for dynamic conditions in fault tolerant algorithms is essential. Performance evaluation by extensive simulation of our algorithms and other fault tolerant routing algorithms show that ours are better than previous algorithms by as much as 50%; and 500%; in time and space, respectively. We also observed that global information about the location of faults does not give us additional benefit. This observation is true regardless of the consideration of the dynamic conditions in the network.< >

关键词： Fault tolerance Routing Hypercubes Telecommunication traffic distributed computing Laboratories Network topology Scalability Hardware Adaptive algorithm

来源：评论

学校读者我要写书评

暂无评论

parallel computing for large-scale author name disambiguation in medline 21

Parallel computing for large-scale author name disambiguatio...

引用

21st IEEE International Conference on High Performance Computing and Communications, 17th IEEE International Conference on Smart City and 5th IEEE International Conference on Data Science and systems, HPCC/SmartCity/DSS 2019

作者： Tang, Anyao Wu, Chengkun Liu, Jie Wang, Wei Yang, Xi Xing, Yuting Science and Technology on Parallel and Distributed Processing Laboratory Laboratory of Software Engineering for Complex Systems National University of Defense Technology Changsha410073 China State Key Laboratory of High Performance Computing College of Computer National University of Defense Technology Changsha410073 China College of Computer National University of Defense Technology Changsha 410073 China

ISBN: (纸本)9781728120584

Author name disambiguation (AND) is an important task in the field of scientific data mining. It has become a great challenge with the rapid growth of academic digital libraries. The task of AND for a large number of authors is computationally intensive. In particular, an author's name in MEDLINE is represented by full last name and initials, like 'Zhang S', which leads to a lot of identical strings that actually represent different names. In this paper, we proposed an efficient algorithm for parallel AND computation. The proposed algorithm mainly addresses the load balancing issue across many computing nodes. It involves the following strategies:(1) Author-based load balancing, which splits the computation load for each core by author name labels. (2) Matrix-based strategy, which calculates the pairwise similarity between publications and saves them in a matrix globally shared by all processes. Then group them by width-first search. We combine the above two strategies, the second of which is used to calculate authors with a large number of documents, and the other authors apply the first. We constructed a publications database written by Chinese authors from MEDLINE, the biggest public database for biomedical literature (abstracts). For benchmark testing, we experimented our algorithm with a dataset of 1 million publications on the Tianhe-2A supercomputer. Firstly, we trained an AND classifier that can achieve 98.1% of F1. The serial computation time is estimated to be approximately 246 hours, while the parallel execution time is approximately 66 hours in the case of four cores on a single node (with a speedup of 3.7x). Finally, we reduced the total parallel computing time of 1 million documents to about 2 hours and achieved 65.8% of parallelism efficiency using 200 cores on 90 nodes. © 2019 IEEE.

关键词： Matrix algebra

来源：评论

学校读者我要写书评

暂无评论

On achieving high performance wireless mesh networks with data fusion

On achieving high performance wireless mesh networks with da...

引用

2007 IEEE International Symposium on a World of Wireless, Mobile and Multimedia Networks, WOWMOM

作者： Sangkil, Jung Sangjin, Hong Kyungtae, Kim Mobile Systems Design Laboratory Dept. of Electrical and Computer Engineering Stony Brook University-SUNY NY 11794 United States IP Network and Distributed Systems NEC Laboratories America Princeton NJ 08540 United States

ISBN: (纸本)1424409926

Wireless Mesh Network (WMN) supports various types of mesh clients such as sensor networks, cellular, 802.11/e Wireless LAN, etc. In this case, it needs to be suitably organized and adopt well-known or newly proposed algorithm to guarantee high and reliable mesh performance. This paper applies RObust Header Compression (ROHC) originate from cellular data network plus packet aggregation to WMNs when mesh clients generate smallsize fusion data, i.e., sensor (delivered by UDP) and voice over IP (VOIP) data. We preliminarily analyze ROHC and packet aggregation improve UDP throughput and the number of supported voice calls. However, the improvement does not include a processor's processing overhead for ROHC and packet aggregation, which is examined by measuring ROHC execution time from Intel Pentium 4 and RouterBOARD, and applying the results into NS-2 simulations. The results indicate UDP and voice performance are seriously affected by the processing overhead. As a solution for the performance degradation, we introduce a hardware design for the two algorithms. By using Systeme Hardware Description Language (HDL), we first design hardware specification composed of 1Ghz master clock and 333Mhz BUS system. Then, we integrate the hardware model into previous NS-2 network model, and propose profile-based network/hardware co-simulation method which gives insight how to investigate real-timing characteristics of the hardware model in the view of network behaviors. © 2007 IEEE.

关键词： Mesh generation

来源：评论

学校读者我要写书评

暂无评论

Cost-based scheduling of scientific workflow applications on utility grids

Cost-based scheduling of scientific workflow applications on...

引用

1st International Conference on e-Science and Grid Computing, e-Science 2005

作者： Yu, Jia Buyya, Rajkumar Tham, Chen Khong Grid Computing and Distributed Systems Laboratory Dept. of Computer Science and Software Engineering University of Melbourne Vic. 3010 Australia Dept. of Electrical and Computer Engineering National University of Singapore 10 Kent Ridge Crescent Singapore 119260 Singapore

ISBN: (纸本)0780394631

over the last few years, Grid technologies have progressed towards a service-oriented paradigm that enables a new way of service provisioning based on utility computing models. Users consume these services based on their QoS (Quality of Service) requirements. In such "pay-per-use" Grids, workflow execution cost must be considered during scheduling based on users' QoS constraints. In this paper, we propose a cost-based workflow scheduling algorithm that minimizes execution cost while meeting the deadline for delivering results. It can also adapt to the delays of service executions by rescheduling unexecuted tasks. We also attempt to optimally solve the task scheduling problem in branches with several sequential tasks by modeling the branch as a Markov Decision Process and using the value iteration method. © 2005 IEEE.

关键词： distributed computer systems

来源：评论

学校读者我要写书评

暂无评论

Toward a reference architecture based science gateway framework with embedded e-learning support

Toward a reference architecture based science gateway framew...

引用

作者： Pierantoni, Gabriele Kiss, Tamas Bolotov, Alexander Kagialis, Dimitrios DesLauriers, James Ullah, Amjad Chen, Huankai Fee, David Chan You Dang, Hai-Van Kovacs, Jozsef Belehaki, Anna Herekakis, Themistocles Tsagouri, Ioanna Gesing, Sandra School of Computer Science and Engineering University of Westminster London United Kingdom Parallel and Distributed Systems Laboratory SZTAKI Budapest Hungary Institute of Astronomy Astrophysics Space Applications and Remote Sensing National Observatory of Athens Athens Greece Department of Computer Science and Engineering University of Notre Dame Notre DameIN United States

Science gateways have been widely utilized by a large number of user communities to simplify access to complex distributed computing infrastructures. While science gateways are still becoming increasingly popular and the number of user communities is growing, the fast and efficient creation of new science gateways and the flexibility to deploy these gateways on-demand on heterogeneous computational resources, remain a challenge. Additionally, the increase in the number of users, especially with very different backgrounds, requires intuitive embedded e-learning tools that support all stakeholders to find related learning material and to guide the learning process. This paper introduces a novel science gateway framework that addresses these challenges. The framework supports the creation, publication, selection, and deployment of cloud-based reference architectures that can be automatically instantiated and executed even by nontechnical users. The framework also incorporates a knowledge repository exchange and learning module that provides embedded e-learning support. To demonstrate the feasibility of the proposed solution, two scientific case studies are presented based on the requirements of the plasmasphere, ionosphere, and thermosphere research communities. © 2022 The Authors. Concurrency and Computation: Practice and Experience published by John Wiley & Sons Ltd.

关键词： Ionosphere

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：