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

5th international symposium on parallel and distributed Processing and Applications/ISPA 2007 international Workshops

作者： Park, Jiyun Lee, Hyunju Kim, Sangwook Kyungpook Natl Univ Dept Comp Sci Taegu South Korea

ISBN: (纸本)9783540747666

there are a variety of AV devices and multimedia content in the ubiquitous home and the sharing of content needs to have high quality of transfer by using optimized transport protocol for the each content. this paper presents the design and implementation of our proposed scheme that is based on UPnP AV framework which can support various transport protocol transparently. We validated and evaluated our proposed scheme and experimental results show that it can stream content effectively.

关键词： Ubiquitous computing

来源：评论

学校读者我要写书评

暂无评论

An out-of-core sorting algorithm for clusters with processors at different speed 16

An out-of-core sorting algorithm for clusters with processor...

引用

16th international parallel and distributed Processing symposium, IPDPS 2002

作者： Cérin, C. Université de Picardie Jules Verne LaRIA Bat CURI 5 rue du moulin neuf Amiens80000 France

the paper deals with the problem of parallel external integer sorting in the context of a class of heterogeneous clusters. We explore some techniques inherited from the homogeneous and in-core cases to show how they c... 详细信息

ISBN: (纸本)0769515738

关键词： Sorting Clustering algorithms Sampling methods Load management Concurrent computing parallel machines parallel processing Context Vocabulary Drives

来源：评论

学校读者我要写书评

暂无评论

Services, standards, and technologies for high performance computational proteomics

Services, standards, and technologies for high performance c...

引用

5th international symposium on parallel and distributed Processing and Applications/ISPA 2007 international Workshops

作者： Cannataro, Mario Veltri, Pierangelo Univ Magna Catanzaro Lab Bioinformat I-88100 Catanzaro Italy

ISBN: (纸本)9783540747666

Proteomics is about the study of the proteins expressed in an organism or a cell. Computational Proteomics regards the computational methods, algorithms, databases, and methodologies used to manage, analyze and interpret the data produced in proteomics experiments. the broad application of proteomics and the increasing resolution offered by technological platforms, especially in Mass Spectrometry-based high-throughput proteomics, make the analysis of proteomics experiments difficult and error prone without efficient algorithms and easy-to-use tools. the paper discusses the requirements of Mass Spectrometry-based Computational Proteomics applications and surveys important services, standards, and technologies useful to build modular, scalable and reusable applications in this field.

关键词： Natural sciences computing

来源：评论

学校读者我要写书评

暂无评论

Improved Bounds for Discrete Diffusive Load Balancing

Improved Bounds for Discrete Diffusive Load Balancing

引用

26th IEEE international parallel and distributed Processing symposium (IPDPS) / Workshop on High Performance Data Intensive computing

作者： Adolphs, Clemens P. J. Berenbrink, Petra Rhein Westfal TH Aachen Lehrstuhl Informat 1 Aachen Germany Simon Fraser Univ Dept Comp Sci Burnaby BC V5A 1S6 Canada

ISBN: (纸本)9780769546759

In this paper we consider load balancing in a static and discrete setting where a fixed number of indivisible tasks have to be allocated to processors. We assume uniform tasks but the processors may have different speeds. the load of a processor is the number of tasks assigned to it divided by its speed. We consider diffusion load balancing which works in rounds. In every round the processors are allowed to compare their own load with the load of their neighbors and to balance the load with the neighbors, using their local information only. the question is how many rounds does it take until the whole processor network is balanced, meaning the load discrepancy (difference between maximum load and m/n) is minimized. Our balancing algorithm is deterministic and extends the algorithm studied in [1] from the case of uniform speeds to non-uniform speeds. We use a potential function argument to show that a better load balance can be obtained when the algorithm is allowed to run longer compared to the algorithm of [1].

关键词： load balancing distributed algorithms reallocation

来源：评论

学校读者我要写书评

暂无评论

A framework for adaptive collective communications for heterogeneous hierarchical computing systems

引用

JOURNAL OF COMPUTER AND SYSTEM SCIENCES 2008年第6期74卷 1082-1093页

作者： Steffenel, Luiz Angelo Mounie, Gregory Univ Nancy 2 LORIA F-54001 Nancy France Lab ID IMAG Grenoble France

Collective communication operations are widely used in MPI applications and play an important role in their performance. However, the network heterogeneity inherent to grid environments represent a great challenge to develop efficient high performance computing applications. In this work we propose a generic framework based on communication models and adaptive techniques for dealing with collective communication patterns on grid platforms. Toward this goal, we address the hierarchical organization of the grid, selecting the most efficient communication algorithms at each network level. Our framework is also adaptive to grid load dynamics since it considers transient network characteristics for dividing the nodes into clusters. Our experiments with the broadcast operation on a real-grid setup indicate that an adaptive framework allows significant performance improvements on MPI collective communications. (C) 2007 Elsevier Inc. All rights reserved.

关键词： grid computing performance modeling adaptive techniques polyalgorithms collective communication MPI

来源：评论

学校读者我要写书评

暂无评论

parallel computation of closed itemsets and implication rule bases

引用

5th international symposium on parallel and distributed Processing and Applications/ISPA 2007 international Workshops

作者： Kengue, Jean Francois Djoufak Valtchev, Petko Djamegni, Clementin Tayou Univ Quebec LATECE Montreal PQ H3C 3P8 Canada Univ Dschang Fac Sci Lab informat Dschang Cameroon

ISBN: (纸本)9783540747413

Formal concept analysis has been successfully applied as a data mining framework whereby target patterns come in the form of intent families and implication bases. Since their extraction is a challenging task, especially for large datasets, parallel techniques should be helpful in reducing the computational effort and increasing the scalability of the approach. In this paper we describe a way to parallelize a recent divide-and-conquer method computing both the intents and the Duquenne-Guiges implication basis of dataset. Wile intents admit a straightforward computation, adding the basis - whose definition is recursive poses harder problems, in particular, for parallel design. A first, and by no means final, solution relies on a partition of the basis that allows the crucial and inherently sequential step of redundancy removal to be nevertheless split into parallel subtasks. A prototype implementation of our method, called PARCIM, shows a nearly linear acceleration w.r.t. its sequential counter-part.

关键词： data mining concept analysis parallel algorithmic design

来源：评论

学校读者我要写书评

暂无评论

Mobile agent model for distributed object systems 5

Mobile agent model for distributed object systems

引用

5th IEEE international symposium on Object-Oriented Real-Time distributed computing, ISORC 2002

作者： Komiya, Takao Ohsida, Hiroyuki Takizawa, Makoto Tokyo Denki University Japan

ISBN: (纸本)0769515584

Application programs are performed on clients and issue requests to object servers. the object servers then send responses to the clients. On the other hand, programs named agents move to object servers where the agents manipulate objects in a mobile agent approach. If agents complete manipulating objects in the servers, the agents move to other servers. If an agent conflicts with other agents on an object server, the agents negotiate with each other to resolve the conflict. If the servers are faulty, agents find another server. In addition, agents are replicated if they are faulty. In this paper, we discuss how to perform agents with different constraints on multiple object servers in the presence of server and agent faults. © 2002 IEEE.

关键词： Real time systems

来源：评论

学校读者我要写书评

暂无评论

three-Phase VSI Supplied by Renewable Energy Sources and Controlled in Voltage and Power Modes For Grid-Tie Operation

Three-Phase VSI Supplied by Renewable Energy Sources and Con...

引用

IEEE 5th international symposium on Power Electronics for distributed Generation Systems (PEDG)

作者： Goncalves, Amilcar F. Q. Bastos, Renan F. Aguiar, Cassius R. Machado, Ricardo Q. Univ Sao Paulo EESC USP Dept Elect Engn & Computat SEL Sao Carlos SP Brazil

ISBN: (纸本)9781479951154

this paper presents a strategy to control the terminal voltage produced by the voltage source inverter (VSI) as well as, the power delivery or absorbed from the grid independently of the local load. the terminal voltage is controlled by means of double cascade PI controllers. the resonant controller is placed in parallel to the classical voltage PI to improve its performance. To enhance the resonant structure dynamic response, an adaptive resonant controller based on the modification of their coefficients is used. Additionally, the paper exhibits the reactive power control at the grid changing the voltage amplitude synthetized by the VSI, and the active power control by means of the management of the angle of displacement between the grid voltage and the VSI terminal voltage. To the power control operates adequately two controllers in decoupled mode of operation (one with faster dynamic response and other with slower time response) are employed. To prove all statements proposed in this paper a set of experimental results are presented.

关键词： AC-DC power converters VSI distributed Generation Power Quality Alternative Sources

来源：评论

学校读者我要写书评

暂无评论

parallel Bayesian Optimization for Optimal Scheduling of Underground Pumped Hydro-Energy Storage Systems 36

Parallel Bayesian Optimization for Optimal Scheduling of Und...

引用

36th IEEE international parallel and distributed Processing symposium (IEEE IPDPS)

作者： Gobert, Maxime Gmys, Jan Toubeau, Jean-Francois Melab, Nouredine Tuyttens, Daniel Vallee, Francois Univ Mons Math & Operat Res Mons Belgium Univ Lille CNRS CRIStAL INRIA Lille Nord Europe Lille France Univ Mons Power Syst & Markets Res Mons Belgium

ISBN: (纸本)9781665497473

Underground Pumped Hydro-Energy Storage stations are sustainable options to enhance storage capacity and thus the flexibility of energy systems. Efficient management of such units requires high-performance optimization algorithms able to find solutions in a very restricted timing to comply with the responsive energy markets. In this context, parallel computing offers a valuable solution to ensure appropriate decisions that maximize the profit of the station operator, while guaranteeing the safety of the energy network. this study investigates the use of three existing algorithms in parallel Bayesian Optimization, namely q-EGO, BSP-EGO and TuRBO. the three algorithms have different inherent behaviors in terms of parallel potential and, even though TuRBO scales better, q-EGO remains the best choice regarding the final outcomes for all investigated batch sizes and manages to get up to 5 times more profits than other approaches.

关键词： Bayesian Optimization Gaussian Process Batch-based parallelism Optimization Electrical Engineering

来源：评论

学校读者我要写书评

暂无评论

K-means parallel acceleration for sparse data dimensions on flink 21

K-means parallel acceleration for sparse data dimensions on ...

引用

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

作者： Zeng, Zihao Li, Kenli Duan, Mingxing Liu, Chubo Liao, Xiangke Dept. College of Computer Science and Electronic Engineering Hunan University Changsha China Dept. College of Computer National University of Defense Technology Changsha China

ISBN: (纸本)9781728120584

the K-means algorithm is a clustering algorithm which widely used in various applications, and it's running time is dramatically increased as the data size expanded. When the volume of data exceeds the range that can be carried by a single machine, the parallel operation of the algorithm must be implemented by using a distributed computing framework. Generally, during the parallel operation of the task, there are differences among the running time of each task due to the data skew, and the running progress of the entire job is determined by the task with the longest running time. In this paper, we propose an optimal data partitioning method for the application of the k-means algorithm on the sparsely dimensioned dataset to eliminate the data skew problem and further accelerate the parallel execution of the algorithm. Experimental evaluation on large-scale text datasets demonstrate the effectiveness of our partitioning approach on Flink. © 2019 IEEE.

关键词： K-means clustering

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：