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

International Workshop on Intelligent Communication and Social Networks

作者： Nor Asilah Wati Abdul Hamid Olivier Serres Ahmad Anbar Sazlinah Hassan High Performance Computing Lab (HPCL) Department of Electrical and Computer Engineering The George Washington University Faculty of Computer Science & Information Technology Universiti Putra Malaysia

ISBN: (纸本)9781479909735

The Partitioned Global Address Space (PGAS) model has been widely used in multi-core clusters as an alternative to MPI. Among the widespread use is Unified Parallel C (UPC). Previous research has shown that UPC performance is comparable with MPI, however in certain cases UPC require hand-tuning techniques such as pre-fetching and privatized pointers-to-shared to improve the performance. In this paper we reviews, evaluate and analyze the performance pattern between UPC Naive, UPC optimize and MPI on two different multi-core clusters architecture. We focus our study using matrix multiplication as the benchmark and perform our experimental on two distributed memory machine;Cray XE6 with Gemini interconnects and Sun Cluster with Infiniband interconnects. We provide analysis on each core execution time to understand the pattern of communication for both machines. We also demonstrate the gaps between naive and optimized are depends on the compiler with its associate distributed memory machine. We also observed unnecessary optimization for certain programs related to HPC architecture and compiler.

关键词： performance Evaluation PGAS UPC MPI Gemini

来源：评论

学校读者我要写书评

暂无评论

Approximation algorithms for the maximum multiple RNA interaction problem

Approximation algorithms for the maximum multiple RNA intera...

引用

7th International Conference on Combinatorial Optimization and Applications, COCOA 2013

作者： Tong, Weitian Goebel, Randy Liu, Tian Lin, Guohui Department of Computing Science University of Alberta Edmonton AB T6G 2E8 Canada Key Laboratory of High Confidence Software Technologies Ministry of Education Institute of Software School of Electronic Engineering and Computer Science Peking University Beijing 100871 China

ISBN: (纸本)9783319037790

RNA interactions are fundamental in many cellular processes, which can involve two or more RNA molecules. Multiple RNA interactions are also believed to be much more complex than pairwise interactions. Recently, multiple RNA interaction prediction has been formulated as a maximization problem. Here we extensively examine this optimization problem under several biologically meaningful interaction models. We present a polynomial time algorithm for the problem when the order of interacting RNAs is known and pseudoknot interactions are allowed;for the general problem without an assumed RNA order, we prove the NP-hardness for both variants (allowing and disallowing pseudoknot interactions), and present a constant ratio approximation algorithm for each of them. © Springer International Publishing 2013.

关键词： Approximation algorithms

来源：评论

学校读者我要写书评

暂无评论

A Scalable RC Architecture for Mean-Shift Clustering

A Scalable RC Architecture for Mean-Shift Clustering

引用

IEEE International Conference on Application-specific Systems, Architectures and Processors

作者： Stefan Craciun Gongyu Wang Alan D. George Herman Lam Jose C. Principe NSF Center for High-Performance Reconfigurable Computing (CHREC) Computational Neuro-Engineering Laboratory (CNEL) Department of Electrical and Computer Engineering University of Florida Gainesville Florida 32611-6200

ISBN: (纸本)9781479904945

The mean-shift algorithm provides a unique non-parametric and unsupervised clustering solution to image segmentation and has a proven record of very good performance for a wide variety of input images. It is essential to image processing because it provides the initial and vital steps to numerous object recognition and tracking applications. However, image segmentation using mean-shift clustering is widely recognized as one of the most compute-intensive tasks in image processing, and suffers from poor scalability with respect to the image size (N pixels) and number of iterations (k): O(kN~2). Our novel approach focuses on creating a scalable hardware architecture fine-tuned to the computational requirements of the mean-shift clustering algorithm. By efficiently parallelizing and mapping the algorithm to reconfigurable hardware, we can effectively cluster hundreds of pixels independently. Each pixel can benefit from its own dedicated pipeline and can move independently of all other pixels towards its respective cluster. By using our mean-shift FPGA architecture, we achieve a speedup of three orders of magnitude with respect to our software baseline.

关键词： mean-shift image segmentation hardware acceleration FPGA reconfigurable computing image segmentation Field programmable gate arrays Scalability pixel Image processing reconfigurable hardware hardware architecture Building construction ARCHITECTURE

来源：评论

学校读者我要写书评

暂无评论

Study on fuzzy semantic controlling for machinery and equipment manufacturing

引用

2013 2nd International Conference on Manufacture engineering, Quality and Production System, ICMEQP 2013

作者： Sun, Heng Cai, Shu Bin Joseph Massawe, Richard Happson Chen, Ling Department of Computer Science Jinan University Guangzhou 510632 China Software Engineering Department Shenzhen University Shenzhen 518060 China Shenzhen Key Laboratory of High Performance Data Mining Shenzhen 518055 China International School Jinan University Guangzhou 510632 China Jinan University Guangzhou 510632 China

ISBN: (纸本)9783037856970

Machinery and equipment descriptions play an important role in the design and manufacturing of industrial machinery devices and help reducing the design time and manufacturing costs of machinery devices. However, one of the main obstacles to realize efficient device design and manufacturing is the lack of effective semantic description method because of the surprisingly increasing volume and semantically fuzzy natures of the industrial device descriptions. To overcome this problem, this paper presents a novel fuzzy ontology-based device description method and implements the intelligent device retrieval and representation system based on the fuzzy ontology. The fuzzy inference and semantic fusion mechanisms of this approach are demonstrated. © (2013) Trans Tech Publications, Switzerland.

关键词： Machinery

来源：评论

学校读者我要写书评

暂无评论

DisClose: Discovering colossal closed itemsets via a memory efficient compact row-tree

DisClose: Discovering colossal closed itemsets via a memory ...

引用

PAKDD 2012 International Workshops: 3rd Data Mining for Healthcare Management, DMHM 2012, Multi-View Data, high-Dimensionality, External Knowledge: Striving for a Unified Approach to Clustering, 3Clust 2012, GeoDoc 2012 and 2nd DSDM 2012

作者： Zulkurnain, Nurul F. Haglin, David J. Keane, John A. Department of Electrical and Computer Engineering Kuliyyah of Engineering International Islamic University Malaysia P.O. Box 10 Kuala Lumpur 50728 Malaysia High Performance Computing Pacific Northwest National Laboratory MSIN J4-30 P.O. Box 999 Richland WA 99352 United States School of Computer Science University of Manchester Oxford Road Manchester M13 9PL United Kingdom

ISBN: (纸本)9783642367779

A recent focus in itemset mining has been the discovery of frequent itemsets from high-dimensional datasets. With exponentially increasing running time as average row length increases, mining such datasets renders most conventional algorithms impractical. Unfortunately, large cardinality itemsets are likely to be more informative than small cardinality itemsets in this type of dataset. This paper proposes an approach, termed DisClose, to extract large cardinality (colossal) closed itemsets from high-dimensional datasets. The approach relies on a Compact Row-Tree data structure to represent itemsets during the search process. Large cardinality itemsets are enumerated first followed by smaller ones. In addition, we utilize a minimum cardinality threshold to further reduce the search space. Experimental results show that DisClose can achieve extraction of colossal closed itemsets in the discovered datasets, even for low support thresholds. The algorithm immediately discovers closed itemsets without needing to check if each new closed itemset has previously been found. © 2013 Springer-Verlag.

关键词： Trees (mathematics)

来源：评论

学校读者我要写书评

暂无评论

Cost Optimization for Scientific Workflow Execution on Cloud computing

Cost Optimization for Scientific Workflow Execution on Cloud...

引用

International Conference on Parallel and Distributed Systems (ICPADS)

作者： Tanyaporn Tirapat Orachun Udomkasemsub Xiaorong Li Tiranee Achalakul Computer Engineering Department King Mongkut's University of Technology Bangkok Thailand Agency for Science Technology and Research (A*STAR) Institute of High Performance Computing (IHPC) Singapore

Scientific workflow applications generally require various levels of computing power over the course of execution. The applications then often take advantage of Cloud computing due to its cost-effective, pay-as-you-go pricing model. However, the scientific workflow executions must be planned wisely in order to minimize total cost of the resource usage. In addition, lateness of completing some workflows may result in high penalty cost. In this paper, the scheduling algorithm based on GA and PSO is proposed for optimizing the workflow execution. The experiment to evaluate the scheduling efficiency is performed on the simple workflow engine developed by the authors. The result is then compared to the existing algorithms including HEFT, GA, PSO, and PSO-SA. The result shows that the proposed GAPSO algorithm has a good potential to give the minimum cost when execution time is restricted.

关键词： Sociology Statistics Genetic algorithms Algorithm design and analysis Scheduling algorithms Engines Schedules

来源：评论

学校读者我要写书评

暂无评论

Boundedness of Hyper-Singular Parametric Marcinkiewicz Integrals with Variable Kernels

引用

Applied Mathematics 2013年第11期4卷 28-34页

作者： Qiquan Fang Xianliang Shi College of Mathematics and Computer Science Hunan Normal University Key Laboratory of High Performance Computing and Stochastic Information Processing (Ministry of Education of China) Hunan Normal University Changsha China Department of Mathematics Zhejiang University of Science and TechnologyHangzhou China

In this article, we consider the boundedness of? on Hardy type space? .

关键词： Hyper-Singular Marcinkiewicz Integral Variable Kernel Multilinear Commutator Hardy Type Space

来源：评论

学校读者我要写书评

暂无评论

Analyzing the Robustness of Scheduling Algorithms Using Divisible Load Theory on Heterogeneous Systems

Analyzing the Robustness of Scheduling Algorithms Using Divi...

引用

International Symposium on Parallel and Distributed computing

作者： Mahadevan Balasubramaniam Ioana Banicescu Florina M. Ciorba Department of Computer Science and Engineering Mississippi State University Mississippi USA Center for Information Services and High Performance Computing (ZIH) Technische Universität Dresden Dresden Germany

ISBN: (纸本)9781479907342

Arbitrarily divisible workloads are present in a large class of scientific applications, such as N-body simulations, Monte Carlo simulations, CFD applications, and others. Divisible load theory (DLT) provides a tractable approach to the scheduling of arbitrarily divisible workloads. high performance parallel and distributed systems may operate in an unreliable environment, and a robust system is expected to deliver a certain level of performance when operating in such an environment. To the best of our knowledge, this is the first work to study and analyze the robustness of DLT algorithms. Using simulations, a study of the resiliency of DLT to variations in certain system features, such as the network latency, the network bandwidth, and the processor availability on a single level tree topology is presented. The simulation results demonstrate the robustness of the DLT algorithms under certain application and system characteristics.

关键词： Robustness Processor scheduling Equations Schedules Bandwidth Computational modeling Runtime

来源：评论

学校读者我要写书评

暂无评论

Erratum to: Measurement of the inclusive jet cross-section in proton-proton collisions at s = 7 TeV using 4.5 fb −1 of data with the ATLAS detector

引用

Journal of high Energy Physics 2015年第9期2015卷 1-39页

作者： G. Aad B. Abbott J. Abdallah S. Abdel Khalek O. Abdinov R. Aben B. Abi M. Abolins O. S. AbouZeid H. Abramowicz H. Abreu R. Abreu Y. Abulaiti B. S. Acharya L. Adamczyk D. L. Adams J. Adelman S. Adomeit T. Adye T. Agatonovic-Jovin J. A. Aguilar-Saavedra M. Agustoni S. P. Ahlen F. Ahmadov G. Aielli H. Akerstedt T. P. A. Åkesson G. Akimoto A. V. Akimov G. L. Alberghi J. Albert S. Albrand M. J. Alconada Verzini M. Aleksa I. N. Aleksandrov C. Alexa G. Alexander G. Alexandre T. Alexopoulos M. Alhroob G. Alimonti L. Alio J. Alison B. M. M. Allbrooke L. J. Allison P. P. Allport J. Almond A. Aloisio A. Alonso F. Alonso C. Alpigiani A. Altheimer B. Alvarez Gonzalez M. G. Alviggi K. Amako Y. Amaral Coutinho C. Amelung D. Amidei S. P. Amor Dos Santos A. Amorim S. Amoroso N. Amram G. Amundsen C. Anastopoulos L. S. Ancu N. Andari T. Andeen C. F. Anders G. Anders K. J. Anderson A. Andreazza V. Andrei X. S. Anduaga S. Angelidakis I. Angelozzi P. Anger A. Angerami F. Anghinolfi A. V. Anisenkov N. Anjos A. Annovi A. Antonaki M. Antonelli A. Antonov J. Antos F. Anulli M. Aoki L. Aperio Bella R. Apolle G. Arabidze I. Aracena Y. Arai J. P. Araque A. T. H. Arce J-F. Arguin S. Argyropoulos M. Arik A. J. Armbruster O. Arnaez V. Arnal H. Arnold M. Arratia O. Arslan A. Artamonov G. Artoni S. Asai N. Asbah A. Ashkenazi B. Åsman L. Asquith K. Assamagan R. Astalos M. Atkinson N. B. Atlay B. Auerbach K. Augsten M. Aurousseau G. Avolio G. Azuelos Y. Azuma M. A. Baak A. Baas C. Bacci H. Bachacou K. Bachas M. Backes M. Backhaus J. Backus Mayes E. Badescu P. Bagiacchi P. Bagnaia Y. Bai T. Bain J. T. Baines O. K. Baker P. Balek F. Balli E. Banas Sw. Banerjee A. A. E. Bannoura V. Bansal H. S. Bansil L. Barak S. P. Baranov E. L. Barberio D. Barberis M. Barbero T. Barillari M. Barisonzi T. Barklow N. Barlow B. M. Barnett R. M. Barnett Z. Barnovska A. Baroncelli G. Barone A. J. Barr F. Barreiro J. Barreiro Guimarães da Costa R. Bartoldus A. E. Barton P. Bartos V. Bartsch A. Bassalat A. Basye R. L. Bates J. R. Batley M. Battaglia M. Battistin F. Bauer H CPPM Aix-Marseille Université and CNRS/IN2P3 Marseille France Homer L. Dodge Department of Physics and Astronomy University of Oklahoma Norman United States Institute of Physics Academia Sinica Taipei Taiwan LAL Université Paris-Sud and CNRS/IN2P3 Orsay France Institute of Physics Azerbaijan Academy of Sciences Baku Azerbaijan Nikhef National Institute for Subatomic Physics and University of Amsterdam Amsterdam Netherlands Department of Physics Oklahoma State University Stillwater United States Department of Physics and Astronomy Michigan State University East Lansing United States Department of Physics University of Toronto Toronto Canada Raymond and Beverly Sackler School of Physics and Astronomy Tel Aviv University Tel Aviv Israel Department of Physics Technion: Israel Institute of Technology Haifa Israel CERN Geneva Switzerland Department of Physics Stockholm University Stockholm Sweden The Oskar Klein Centre Stockholm Sweden INFN Gruppo Collegato di Udine Sezione di Trieste Udine Italy ICTP Trieste Italy Department of Physics King’s College London London United Kingdom AGH University of Science and Technology Faculty of Physics and Applied Computer Science Krakow Poland Physics Department Brookhaven National Laboratory Upton United States Department of Physics Yale University New Haven United States Fakultät für Physik Ludwig-Maximilians-Universität München München Germany Particle Physics Department Rutherford Appleton Laboratory Didcot United Kingdom Institute of Physics University of Belgrade Belgrade Serbia Laboratorio de Instrumentacao e Fisica Experimental de Particulas - LIP Lisboa Portugal Departamento de Fisica Teorica y del Cosmos and CAFPE Universidad de Granada Granada Spain Albert Einstein Center for Fundamental Physics and Laboratory for High Energy Physics University of Bern Bern Switzerland Department of Physics Boston University Boston United States Joint Institute for Nuclear Research JINR Dubna Dubna Russia INFN

It was found that the non-perturbative corrections calculated using Pythia with the Perugia 2011 tune did not include the effect of the underlying event. The affected correction factors were recomputed using the Pythia 6.427 generator. These corrections are applied as baseline to the NLO pQCD calculations and thus the central values of the theoretical predictions have changed by a few percent with the new corrections. This has a minor impact on the agreement between the data and the theoretical predictions. Figures 2 and 6 to 13, and all the tables have been updated with the new values. A few sentences in the discussion in sections 5.2 and 9 were altered or removed.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Evaluating the Flexibility of Dynamic Loop Scheduling on Heterogeneous Systems in the Presence of Fluctuating Load Using SimGrid

Evaluating the Flexibility of Dynamic Loop Scheduling on Het...

引用

IEEE International Symposium on Parallel and Distributed Processing Workshops and Phd Forum (IPDPSW)

作者： Nitin Sukhija Ioana Banicescu Srishti Srivastava Florina M. Ciorba Department of Computer Science and Engineering Mississippi State University Mississippi State MS USA Technische Universität Dresden Center for Information Services and High Performance Computing Dresden Germany

ISBN: (纸本)9781479913725

Scientific applications running on heterogeneous computing systems, which often have unpredictable behavior, enhance their performance by employing loop scheduling techniques as methods to avoid load imbalance through an optimized assignment of their parallel loops. With current computing platforms facilitating petascale performance and promising exascale performance towards the end of the present decade, efficient and robust algorithms are required to guarantee optimal performance of parallel applications in the presence of unpredictable perturbations. A number of dynamic loop scheduling (DLS) methods based on probabilistic analyses have been developed to achieve the desired robust performance. In earlier work, two metrics (flexibility and resilience) have been formulated to quantify the robustness of various DLS methods in heterogeneous computing systems with uncertainties. In this work, to ensure robust performance of the scientific applications on current (petascale) and future(exascale) high performance computing systems, a simulation model was designed and integrated into the SimGrid simulation toolkit, thus enabling a comprehensive study of the robustness of the DLS methods which uses results of experimental cases with various combinations of number of processors, problem sizes, and scheduling methods. The DLS methods have been implemented into the simulation model and analyzed for the purpose of exploring their flexibility (robustness against unpredictable variations in the system load), when involved in a range of case scenarios comprised of various distributions characterizing loop iteration execution times and system availability. The simulation results reported are used to compare the robustness of the DLS methods under the various environments considered, using the flexibility metric.

关键词： Robustness Program processors Computational modeling Availability Processor scheduling Load modeling Measurement

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：