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

10th international conference on algorithms and architectures for parallel processing

作者： Lee, Liang-Teh Lee, Shin-Tsung Chen, Ching-Wei Tatung Univ Dept Comp Sci & Engn Taipei 10452 Taiwan

ISBN: (纸本)9783642131356

Soft-core system allows designers to modify the components which are in the architecture they designed conveniently. In some systems, uni-core processor can not provide enough computing power to support a huge amount of computing for specific applications. In order to improve the performance of a multi-core system, in addition to the hardware architecture design, parallel programming is an important issue. the current parallelizing compilers are hard to parallelize the programs effectively. the programmer must think about how to allot the task to each processor in the beginning. In this paper, we present a software framework for designing parallel program. the proposed framework provides a convenient parallel programming environment for programmers to design the multi-core system's software. From the experiments, the proposed framework can parallelize the program effectively by applying the provided functions.

关键词： parallel programming

来源：评论

学校读者我要写书评

暂无评论

Data interoperation between ChinaGrid and SRB

Data interoperation between ChinaGrid and SRB

引用

7th international conference on algorithms and architectures for parallel processing

作者： Xiong, Muzhou Jin, Hai Wu, Song Huazhong Univ Sci & Technol Serv Comp Technol Cluster & Grid Comp Lab Sch Comp Sci & Technol Wuhan 430074 Peoples R China

ISBN: (纸本)9783540729044

Separated grid systems. are becoming the new information islands when more and more grid systems are deployed. Grid interoperation is a direction to solve that problem. this paper introduces the implementation of data interoperation between ChinaGrid and SRB. the data interoperation between them is divided into two parts: data access from SRB to ChinaGrid and from ChinaGrid to SRB. Also this paper considers the issues about performance optimization. We get a satisfied experiment result through the optimization measures.

关键词： Data processing

来源：评论

学校读者我要写书评

暂无评论

A general approach to predict the performance order of TSP family problems

A general approach to predict the performance order of TSP f...

引用

8th international conference on algorithms and architectures for parallel processing

作者： Fritzsche, P. Rexachs, D. Luque, E. Univ Autonoma Barcelona Comp Architecture & Operating Syst Dept Barcelona Spain

ISBN: (纸本)9783540695004

parallel computers provide an efficient and economical way to solve large-scale and/or time-constrained scientific, engineering, and industry problems. Consequently, there is a need to predict the performance order of both deterministic and non-deterministic parallel algorithms. the performance prediction of the traveling salesman problem (TSP) is a challenging problem because similar input data sets may cause significant variability in execution times. parallel performance of data-dependent algorithms depends on the problem size, the number of processors, and other parameters. Discovering the main other parameters is the real key to obtain a good estimation of performance order. this paper presents a novel methodology to the problem of predicting the performance of a parallel algorithm for solving the TSP. the entire process explores data in search of patterns and/or relationships detecting the main parameters that affect performance. then, it uses the measured values for this limited number of inputs to produce a multiple-linear-regression model. Finally, the regression equation allows for predicting how the algorithm will respond when given new input data sets. the preliminary experimental results are quite promising.

关键词： performance prediction TSP data-dependent algorithms parallel computing

来源：评论

学校读者我要写书评

暂无评论

Communication Avoiding algorithms: Analysis and Code Generation for parallel Systems 24

Communication Avoiding Algorithms: Analysis and Code Generat...

引用

24th international conference on parallel Architecture and Compilation (PACT)

作者： Murthy, Karthik Mellor-Crummey, John Rice Univ Dept Comp Sci Houston TX USA

ISBN: (纸本)9781467395243

Data movement is a critical bottleneck for future generations of parallel systems. the class of .5D communication-avoiding algorithms were developed to address this bottleneck. these algorithms reduce communication and provide strong scaling in both time and energy. As a first step towards automating the development of communication-avoiding libraries, we developed the Maunam compiler. Maunam generates efficient parallel code from a high-level, global view sketch of .5D algorithms that are expressed using symbolic data sizes and numbers of processors. It supports the expression of data movement and communication through high-level global operations such as TILT and CSHIFT as well as through element-wise copy operations. With the latter, wraparound communication patterns can also be achieved using subscripts based on modulo operations. Maunam employs polyhedral analysis to reason about communication and computation present in a .5D algorithm. After partitioning data and computation, it inserts point-to-point and collective communication as needed. Maunam also analyzes data dependence patterns and data layouts to identify reductions over processor subsets. Maunam-generated Fortran+MPI code for 2.5D matrix multiplication running on 4096 cores of a Cray XC30 supercomputer achieves 59 TFlops/s (76% of the machine peak). Our generated parallel code achieves 91% of the performance of a hand-coded version.

关键词： Compilers polyhedral methods reductions modulo operations optimization parallel code generation

来源：评论

学校读者我要写书评

暂无评论

Recent Advances in Object Detection and Tracking for High Resolution Video: Overview and State-of-the-Art 5

Recent Advances in Object Detection and Tracking for High Re...

引用

5th international conference on Computing, Communication Control and Automation (ICCUBEA)

作者： Rajjak, Shaikh Shakil Abdul Kureshi, A. K. Matoshri Coll Engn & Res Ctr Dept Elect & Telecommun Nasik India Savitribai Phule Pune Univ Pune Maharashtra India

ISBN: (纸本)9781728140421

Object detection and tracking at real time is important and challenging tasks in many computer vision applications such as video robot navigation, surveillance, vehicle navigation, security applications, military applications, patient monitoring system and traffic monitoring system. Object detection includes detecting the object in sequence of videos. In this paper we reviewed the different methods/algorithms for object detection and tracking at real time for high resolution video. Now day's high resolution imaging sensors/cameras is being used in different areas of applications such as security system, in military applications etc. For object detection and tracking in high resolution, greater frame rate requires more time to process a single frame, so it is an extreme challenges for researchers to detect and track target at real time. this sets a demand for fast computational algorithms for real time processing of high resolution videos. Moving object detection and tracking is one of the decisive active areas of research since last decade. In this paper we address and highlight a brief survey or review of various real time object detection and tracking algorithms for high resolution video available in the literature.

关键词： Motion tracking Moving object detection High Definition (HD) Heterogeneous architectures Occlusions Graphical processing Unit

来源：评论

学校读者我要写书评

暂无评论

A NEW PRESENTATION OF METACUBES FOR ALGORIthMIC DESIGN AND CASE STUDIES: parallel PREFIX COMPUTATION AND parallel SORTING

引用

JOURNAL OF thE CHINESE INSTITUTE OF ENGINEERS 2009年第7期32卷 939-949页

作者： Li, Yamin Peng, Shietung Chu, Wanming Hosei Univ Dept Comp Sci Tokyo 1848584 Japan Univ Aizu Dept Comp Hardware Aizu Wakamatsu Fukushima 9658580 Japan

A versatile family of interconnection networks alternative to hypercubes, called Metacubes, has been proposed for building extremely large scale multiprocessor systems with a small number of links per node. A Metacube MC(k, m) connects 2(2km + k) nodes with only k + in links per node. Metacube can be used to build parallel computing systems of very large scale with a small number of links per node. In this paper, we propose a new presentation of Metacube for algorithmic design. Based on the new presentation, we give efficient algorithms for parallel prefix computation and parallel sorting on Metacubes, respectively. the algorithm for prefix computation runs in 2(k)m (k + 1) + k communication steps and 2(k + 1)m + 2k computation steps on MC(k, m). the sort algorithm runs in O(2(k)m + k)(2) computation steps and O(2(k)m (2k + 1) + k)(2) communication steps on MC(k, m).

关键词： Hypercube Metacube parallel prefix parallel sorting

来源：评论

学校读者我要写书评

暂无评论

ProcSimity: An experimental tool for processor allocation and scheduling in highly parallel systems

ProcSimity: An experimental tool for processor allocation an...

引用

Proceedings of the 5th Symposium on the Frontiers of Massively parallel Computation

作者： Windisch, Kurt Miller, Jayne Valenti Lo, Virginia Univ of Oregon Eugene United States

ProcSimity is a software tool that supports research in processor allocation and scheduling for highly parallel systems. ProcSimity's multicomputer simulator supports experimentation with selected allocation and scheduling algorithms on architectures with a range of network topologies and for several current routing and flow control mechanisms. Message-passing can be simulated in detail at the flit level or at a higher level of modeling. Our tool supports both stochastic job streams as well as communication patterns from actual parallel applications, including several of the NAS parallel benchmarks. ProcSimity's visualization and performance analysis tool allows the user to view a dynamic animation of the selected algorithms as well as a variety of system and job level performance metrics. ProcSimity has been successfully used in experiments investigating the feasibility of non-contiguous processor allocation in meshes and k-ary n-cubes.

关键词： parallel processing systems

来源：评论

学校读者我要写书评

暂无评论

Gang scheduling with lightweight user-level communication

Gang scheduling with lightweight user-level communication

引用

30th international conference on parallel processing (ICPP Workshops)

作者： Frachtenberg, E Petrini, F Coll, S Feng, WC Los Alamos Natl Lab CCS3 Modeling Algorithms & Informat Grp Comp & Computat Sci CCS Div Los Alamos NM 87545 USA

ISBN: (纸本)0769512607

In this paper we explore the performance of gang scheduling on a cluster using the Quadrics interconnection network. In such a cluster the scheduler can take advantage of this network's unique capabilities, including a network interface card-based processor and memory and efficient user-level communication libraries. We developed a micro-benchmark to test the scheduler's performance under various aspects of parallel job workloads: memory usage, bandwidth and latency-bound communication, number of processes, timeslice quantum, and multiprogramming levels. Our experiments show that the gang scheduler performs relatively well under most workload conditions, is largely insensitive to the number of concurrent jobs in the system and scales almost linearly with number of nodes. On the other hand, the scheduler is very sensitive to the timeslice quantum, and values under 30 seconds can incur large overheads and fairness problems.

关键词： gang scheduling performance evaluation parallel architectures quadrics interconnect

来源：评论

学校读者我要写书评

暂无评论

Fast adaptive ultrasound speckle reduction with bilateral filter on CUDA

Fast adaptive ultrasound speckle reduction with bilateral fi...

引用

5th international conference on Bioinformatics and Biomedical Engineering, iCBBE 2011

作者： Jiang, Fengjiao Shi, Dan Liu, Dong C. Computer Science College Sichuan University Chengdu China

ISBN: (纸本)9781424450893

the Compute Unified Device Architecture (CUDA) is a new parallel processing platform making use of the unified shader design of the most current Graphics processing Units (GPUs) from NVIDIA. In this paper, we apply this revolutionary new technology to implement the speckle reduction with adaptive bilateral filter for medical ultrasound imaging. the parallel speckle detection and mask producing with space for time algorithms are also presented. this bilateral filter method achieves a frame rate of 30 fps for the 256×512 image with once iteration, about 44 times faster than the CPU implementation. Testing results from GPU and CPU are compared in terms of visual image quality and program runtime with different image sizes. © 2011 IEEE.

关键词： Graphics processing unit

来源：评论

学校读者我要写书评

暂无评论

Novel Heuristic Mapping algorithms for Design Space Exploration of Multiprocessor Embedded architectures 24

Novel Heuristic Mapping Algorithms for Design Space Explorat...

引用

24th Euromicro international conference on parallel, Distributed, and Network-Based processing (PDP)

作者： Sinaei, Sima Fatemi, Omid Univ Tehran Nanoelect Ctr Excellence Elect & Comp Engn Dept Fac Engn Campus 2 Tehran Iran

ISBN: (纸本)9781467387767

Electronic System level design has an important role in the multi-processor embedded system on chip design. Two important steps in this process are evaluation of a single design configuration and design space exploration. In the first part of design process, high-level simple analytical models for application mapping and evaluation are used and modified aiming at accelerating the evaluation of a single design configuration. Using the analytical model the design space is pruned and explored at high speed with low accuracy. In the second part of the design process, two Multi Objective Optimization algorithms based on Particle Swarm Optimization and Simulated Annealing have been proposed to perform design space exploration of the pruned design space with higher accuracy taking advantages of low-level architectural simulation engines. the results obtained by proposed algorithms will provide the designer more accurate solutions within an acceptable time. Considering the MJPEG application as the case study, each of these methods produces a set of near-optimal points. Simulation results show that the proposed methods can lead to near-optimal design configurations with acceptable accuracy in reasonable time.

关键词： Design Space Exploration System-Level Design Multi-Objective Optimization Heterogeneous platforms

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：