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

international symposium on parallel and distributed Processing (IPDPS)

作者： Jatin Chhugani Nadathur Satish Changkyu Kim Jason Sewall Pradeep Dubey Parallel Computing Laboratory Intel Corporation USA

Graph-based structures are being increasingly used to model data and relations among data in a number of fields. Graph-based databases are becoming more popular as a means to better represent such data. Graph traversal is a key component in graph algorithms such as reachability and graph matching. Since the scale of data stored and queried in these databases is increasing, it is important to obtain high performing implementations of graph traversal that can efficiently utilize the processing power of modern processors. In this work, we present a scalable Breadth-First Search Traversal algorithm for modern multi-socket, multi-core CPUs. Our algorithm uses lock- and atomic-free operations on a cache-resident structure for arbitrary sized graphs to filter out expensive main memory accesses, and completely and efficiently utilizes all available bandwidth resources. We propose a work distribution approach for multi-socket platforms that ensures load-balancing while keeping cross-socket communication low. We provide a detailed analytical model that accurately projects the performance of our single- and multi-socket traversal algorithms to within 5-10% of obtained performance. Our analytical model serves as a useful tool to analyze performance bottlenecks on modern CPUs. When measured on various synthetic and real-world graphs with a wide range of graph sizes, vertex degrees and graph diameters, our implementation on a dual-socket Intel ® Xeon ® X5570 (Intel microarchitecture code name Nehalem) system achieves 1.5X-13.2X performance speedup over the best reported numbers. We achieve around 1 Billion traversed edges per second on a scale-free R-MAT graph with 64M vertices and 2 Billion edges on a dual-socket Nehalem system. Our optimized algorithm is useful as a building block for efficient multi-node implementations and future exascale systems, thereby allowing them to ride the trend of increasing per-node compute and bandwidth resources.

关键词： Sockets Arrays Bandwidth Instruction sets Partitioning algorithms

来源：评论

学校读者我要写书评

暂无评论

Presentation an approach for useful rate based on changing many tasks of workflow in distributed systems

引用

international Journal of Computer Science Issues 2012年第4 4-2期9卷 509-514页

作者： Parseh, Farzad Manesh, Rohollah Esmaeli Zareie, Ahmad Khosravi, Meysam Ghasemi, Vahid Parandin, Fariborz Young Researchers Ghasre Shirin Branch Islamic Azad University Ghasre Shirin Kermanshah Iran Department of Computer Engineering Islamic Azad University Eslamabad-E-Gharb Branch Eslamabad-E-Gharb Iran Young Researchers Club Songhor Branch Islamic Azad University Songhor Kermanshah Iran Eslam Abad Gharb Kermanshah Iran

Cloud computing refers to a network that distributes processing power, applications, and large systems among many computers With the significant advances in Information and Communications Technology (ICT) over the last half century, there is an increasingly perceived vision that computing will one day be the 5th utility (after water, electricity, gas, and telephony). this computing utility, like all other four existing utilities, will provide the basic level of computing service that is considered essential to meet the everyday needs of the general community. To deliver this vision, a number of computing paradigms have been proposed, of which the latest one is known as Cloud computing. the distributed system consists of a number of data centers that presents different services through internet. In a distributed system Timing and mapping the priority of tasks among processors is one of the issues attracted most of attention to itself. this issue consists of mapping a Direct Acyclic Graph with a set of tasks on a number of parallel processors and its purpose is allocating tasks to the available processors in order to satisfy the needs of priority and decency of tasks, and also to minimize the duration time of execution in total graph. In this article, we'll represent an algorithm that useful rate based on changing many tasks of workflow. Simulation is showed that the way for me is better about the list schedule algorithm. © 2012 international Journal of Computer Science Issues.

关键词： Cloud computing

来源：评论

学校读者我要写书评

暂无评论

Cunetsim: a new simulation framework for large scale mobile networks 12

Cunetsim: a new simulation framework for large scale mobile ...

引用

Proceedings of the 5th international ICST Conference on Simulation Tools and Techniques

作者： Ben Romdhanne Bilel Nikaein Navid Eurecom BP Sophia-Antipolis cedex France

ISBN: (纸本)9781450315104

Most of the existing packet-level simulation tools are designed to perform experiments modeling small to medium scale network nodes. the main reason of this limitation is the amount of available computation power and memory in quasi mono-process simulation environment. To enable efficient packet-level simulation for large scale scenario, we introduce a CPU-GPU co-simulation framework where synchronization and experiment design are performed in CPU and node's logical processes are executed in parallel in GPU according to the master/worker model. the framework is developed using Compute-Unified Device Architecture and denoted as Cunetsim, CUDA network simulator. In this work, we study the node mobility and connectivity as they are among the most time consuming task when large scale network is simulated. Simulation results show that Cunetsim execution time remains stable and that it achieves significantly lower execution time than existing approach when computing mobility and connectivity with no degradation in the accuracy of the results.

关键词： large scale simulation evaluation distributed simulation GPGPU large scale simulation

来源：评论

学校读者我要写书评

暂无评论

VTDC'11 - Proceedings of the 5th international Workshop on Virtualization Technologies in distributed computing

VTDC'11 - Proceedings of the 5th International Workshop on V...

引用

5th international Workshop on Virtualization Technologies in distributed computing, VTDC'11, Co-located with 20th international ACM symposium on High-Performance parallel and distributed computing, HPDC 2011

ISBN: (纸本)9781450307017

the proceedings contain 4 papers. the topics discussed include: Shadowfax: scaling in heterogeneous cluster systems via GPGPU assemblies;reactive consolidation of virtual machines enabled by postcopy live migration;performance of SAP ERP with memory virtualization using IBM active memory expansion as an example;and practical cloud evaluation from a Nordic escience user perspective.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Segmentation of Tumor in Digital Mammograms Using Wavelet Transform Modulus Maxima on a Low Cost parallel computing System

Segmentation of Tumor in Digital Mammograms Using Wavelet Tr...

引用

5th Kuala Lumpur international Conference on Biomedical Engineering (BIOMED 2011)

作者： Sulaiman, Hanifah Ibrahim, Arsmah Alias, Norma Univ Teknol MARA Fac Comp & Math Sci Shah Alam 40450 Selangor Malaysia Univ Teknol Malaysia Inst Ibnu Sina Skudai 81310 Malaysia

ISBN: (纸本)9783642217289

parallel computing System (PCS) is currently used widely in many applications of complex problems involving high computations. this is because it has the capability to process computations efficiently using a parallel scheme. ARS cluster is a low-cost PCS developed to implement processing of full-field digital mammograms. In this system eight processors are used to communicate via the Ethernet network using LINUX which is Fedora 7 as the operating system and Matlab distributed computing Server (MDCS) as a platform to process the digital mammograms. In this paper the Wavelet Transforms Modulus Maxima (WTMM) method is used to detect the edge of tumor in digital mammogram implemented on the ARS cluster. the study involved 80 digitized mammographic images obtained from the Malaysian National Cancer Center (NCC). the performance of the PCS in detecting the edge of tumors in digital mammograms using WTMM on the ARS cluster is reported. the experimental results showed that the speedup of the PCS improves when the number of processors is increased.

关键词： Breast Tumor Digital Mammograms Edge Detection Segmentation Matlab distributed computing Server parallel Processing Wavelet Transform Modulus Maxima

来源：评论

学校读者我要写书评

暂无评论

Cloud computing learning

Cloud computing learning

引用

2011 5th international Conference on Application of Information and Communication Technologies, AICT 2011

作者： Kalagiakos, Panagiotis Karampelas, Panagiotis Department of Information Technology Hellenic American University Manchester NH United States

ISBN: (纸本)9781612848310

Cloud computing is evolving as a key technology for sharing resources. Grid computing, distributed computing, parallel computing and virtualization technologies define the shape of a new era. Traditional distance learning systems lack reusability, portability and interoperability. this paper sees cloud computing ecosystem as a new opportunity in designing cloud computing educational platforms where learning actors can reuse learning resources handled by cloud educational operating systems. To enhance learning objects portability and interoperability not only cloud computing API standards should be advocated by the key cloud providers but also learning resources standards should be defined by the Open Cloud computing Education Federation as proposed by this paper. © 2011 IEEE.

关键词： Cloud computing

来源：评论

学校读者我要写书评

暂无评论

Demo: distributed event processing for activity recognition

Demo: Distributed event processing for activity recognition

引用

5th ACM international Conference on distributed Event-Based Systems, DEBS'11

作者： Suresh, Visalakshmi Ezhilchelvan, Paul Watson, Paul Pham, Cuong Jackson, Dan Olivier, Patrick Newcastle University School of Computing Science Newcastle Upon Tyne United Kingdom

ISBN: (纸本)9781450309059

Stream-processing systems inevitably face unpredictable variations in incoming event loads. One way of handling this without affecting end-to-end performance metrics, will be to dynamically distribute event-processing on multiple computers and thus avail compute power for optimal performance. More precisely, data streams are processed in part or in parallel on multiple computers connected by a high bandwidth network. the number of computers being used is to be varied dynamically to cope with input load fluctuations. this paper uses data from ambient kitchen to make a preliminary assessment of performance advantages by distribution of real-time data stream processing. the motivation is to leverage cloud computing for optimal realtime event processing. © 2011 Authors.

关键词： Real time systems

来源：评论

学校读者我要写书评

暂无评论

Optimal deployment of eventually-serializable data services

引用

ANNALS OF OPERATIONS RESEARCH 2011年第1期184卷 273-294页

作者： Michel, L. Shvartsman, A. Sonderegger, E. Van Hentenryck, P. Univ Connecticut Storrs CT 06269 USA Brown Univ Providence RI 02912 USA

Providing consistent and fault-tolerant distributed object services is among the fundamental problems in distributed computing. To achieve fault-tolerance and to increase throughput, objects are replicated at different networked nodes. However, replication induces significant communication costs to maintain replica consistency. Eventually-Serializable Data Service (ESDS) has been proposed to reduce these costs and enable fast operations on data, while still providing guarantees that the replicated data will eventually be consistent. this paper reconsiders the deployment phase of ESDS, in which a particular implementation of communicating software components must be mapped onto a physical architecture. this deployment aims at minimizing the overall communication costs, while satisfying the constraints imposed by the protocol. Both MIP (Mixed Integer Programming) and CP (Constraint Programming) models are presented and applied to realistic ESDS instances. the experimental results indicate that both models can find optimal solutions and prove optimality. the CP model, however, provides orders of magnitude improvements in efficiency. the limitations of the MIP model and the critical aspects of the CP model are discussed. Symmetry breaking and parallel computing are also shown to bring significant benefits.

关键词： FAULT-tolerant computing distributed computing DATA replication COMMUNICATION INTEGER programming CONSTRAINT programming (Computer science) SOFTWARE

来源：评论

学校读者我要写书评

暂无评论

A DHT-based scalable and fault-tolerant cloud information service

A DHT-based scalable and fault-tolerant cloud information se...

引用

5th international Conference on Mobile Ubiquitous computing, Systems, Services and Technologies, UBICOMM 2011;3rd international Workshop on Pervasive computing in Embedded Systems, PECES 2011

作者： Zhelev, Radko Georgiev, Vasil Institute on Parallel Processing Bulgarian Academy of Sciences Sofia Bulgaria Faculty on Mathematics and Informatics University of Sofia St. Cl. Ochridsky Sofia Bulgaria

ISBN: (纸本)9781612081717

In this paper, we present an Information Service designed for maintaining resource information in Cloud datacenters. We employ a P2P cluster of super-peers that share the resource information and load of related activities in a distributed Hash Table (DHT) based manner. Our DHT does not employ the standard keyspace range-partitioning, but implements more complicated algorithm to enable better distribution and fault-tolerance in the Cloud datacenter context. We implement a prototype of the proposed system and conduct comparative measurements that illustrate its scalable and fault-tolerant capabilities.

关键词： Information services

来源：评论

学校读者我要写书评

暂无评论

Challenges of scaling algebraic multigrid across modern multicore architectures

Challenges of scaling algebraic multigrid across modern mult...

引用

25th IEEE international parallel and distributed Processing symposium, IPDPS 2011

作者： Baker, Allison H. Gamblin, Todd Schulz, Martin Yang, Ulrike Meier Center for Applied Scientific Computing Lawrence Livermore National Laboratory 7000 East Avenue Livermore CA 94550 United States

ISBN: (纸本)9780769543857

Algebraic multigrid (AMG) is a popular solver for large-scale scientific computing and an essential component of many simulation codes. AMG has shown to be extremely efficient on distributed-memory architectures. However, when executed on modern multicore architectures, we face new challenges that can significantly deteriorate AMG's performance. We examine its performance and scalability on three disparate multicore architectures: a cluster with four AMD Opteron Quad-core processors per node (Hera), a Cray XT5 with two AMD Opteron Hex-core processors per node (Jaguar), and an IBM Blue Gene/P system with a single Quad-core processor (Intrepid). We discuss our experiences on these platforms and present results using both an MPI-only and a hybrid MPI/OpenMP model. We also discuss a set of techniques that helped to overcome the associated problems, including thread and process pinning and correct memory associations. © 2011 IEEE.

关键词： Memory architecture

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：