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

distributed image processing over an adaptive Campus Grid

CONCURRENCY AND COMPUTATION-PRACTICE & EXPERIENCE 2009年第3期21卷 321-336页

作者： Caton, Simon J. Rana, Omer F. Batchelor, Bruce G. Cardiff Univ Sch Comp Sci Cardiff CF24 3AA S Glam Wales

A system implemented in MATLAB is described, which may be deployed over a Campus Grid utilizing the Condor job management system. Our approach can re-distribute jobs as node availability changes. the architecture of the system, its components, and their deployment across the Cardiff University Campus Grid (consisting of 2500 machines) are presented. Challenges in image processing applications that can be deployed over such infrastructure are presented, along with performance results that demonstrate the use of our system alongside a standard Condor deployment, demonstrating a significant increase in throughput using our approach(double dagger). Copyright (C) 2008 John Wiley & Sons, Ltd.

关键词： Condor Campus Grid adaptive resource allocation MATLAB

来源：评论

学校读者我要写书评

暂无评论

Mobile backbone networks --: construction and maintenance 06

Mobile backbone networks --: construction and maintenance

引用

Proceedings of the 7th ACM international symposium on Mobile ad hoc networking and computing

作者： Anand Srinivas Gil Zussman Eytan Modiano Massachusetts Institute of Technology

ISBN: (纸本)9781595933683

We study a novel hierarchical wireless networking approach in which some of the nodes are more capable than *** such networks,the more capable nodes can serve as Mobile Backbone Nodes and provide a backbone over which end-to-end communication can take place. Our approac consists of controlling the mobility of the Backbone Nodes in order to maintain connectivity. We formulate the problem of minimizing the number of backbone nodes and refer to it as the Connected Disk Cover *** show that it can be decomposed into the Geometric Disk Cover (GDC)problem and the Steiner Tree Problem wit Minimum Number of Steiner Points (STP-MSP). We prove that if these sub-problems are solved separately by γ- and δ- approximation algorithms, the approximation ratio of t e joint solution is γ + δ. then, we focus on the two subproblems and present a number of distributed approximation algorithms that maintain a solution to the GDC problem under mobility A new approach to the solution of the STP-MSP is also described. We show that this approach can be extended in order to obtain a joint approximate solution to the Connected Disk Cover problem. Finally, we evaluate the performance of the algorithms via simulation and show that the proposed GDC algorithms perform very well under mobility and that the new approac for the joint solution can significantly reduce the number of required Mobile Backbone Nodes.

关键词： approximation algorithms wireless networks controlled mobility distributed algorithms disk cover

来源：评论

学校读者我要写书评

暂无评论

A realization of arbitrary BPC permutations in bidirectional hypercube and chordal ring networks

A realization of arbitrary BPC permutations in bidirectional...

引用

international Conference on Computer Communications and Networks (ICCCN)

作者： Y. Morita H. Masuyama E. Masuyama Hitachi Research Laboratory Hitachi and Limited Japan Information and Knowledge Engineering Tottori University Tottori Japan Life Science Hiroshima Women''s University

ISBN: (纸本)0818690143

A multiple instruction stream-multiple data stream (MIMD) computer is a parallel computer with a large number of identical processing elements. the essential feature that distinguishes each MIMD computer family is the interconnection network. In this paper, we are concerned with two representative types of interconnection networks that are called the hypercube and the chordal ring networks. A family of regular graphs is presented as a possible candidate for the implementation of a distributed system and for fault-tolerant architecture. the symmetry of these graphs makes it possible to determine message routing by using a simple distributed algorithm. Arbitrary data permutations are generally accomplished by sorting. For certain classes of permutations, however, (for example, many frequently used permutations in parallel processing, such as bit reversal, bit shuffle, bit complement, matrix transpose, butterfly permutations in FFT algorithms, and segment shuffles), there are algorithms that are more efficient than the best sorting algorithm. One of these is the bit permute complement (BPC) class of permutations. We have developed algorithms for bidirectional networks. the developed algorithm in hypercube networks requires only 1 token memory register in each node. the algorithm takes the same number of steps as the maximum Hamming distance. therefore, we have concluded that the presented algorithm is the optimal one. On the other hand, the developed algorithm in chordal ring networks requires 2 token storage register. the number of required routing steps in two kinds of networks is evaluated.

关键词： Computer aided instruction Concurrent computing Multiprocessor interconnection networks Hypercubes Routing Sorting Registers Computer networks Fault tolerant systems Computer architecture

来源：评论

学校读者我要写书评

暂无评论

Camera trapping for mammal species in mountain forests: correlates of trapping rate and human presence

Camera trapping for mammal species in mountain forests: corr...

引用

the 7th international symposium of Integrative Zoology——Wildlife Monitoring and Data Collection under Global Change

作者： Li Xueyou Jiang Xuelong State Key Laboratory of Genetic Resources and Evolution Kunming Institute of ZoologyChinese Academy of Sciences

We present community-level study of the associations of human presence with the distribution of mammals in Northwest Yunnan *** study sites were in a biodiversity hotspot which had been designated as part of the three parallel Rivers World Natural Heritage *** conducted surveys across 72 camera trapping locations to document mammal presence and *** used generalized linear mixed-effect models to document associations between ecological variables and the trapping rates of 8 mammal species including takin(Budorcus taxicolor),serow(Capricornis milneedwardsii),goral(Neamorhaedus griseus),blue sheep(Pseudois nayaur),tufted deer(Elaphodus cephalophus),musk deer(Moschus chrysogaster),leopard cat(Prionailurus bengalensis)and yellow-throated marten(Martes flavigula).We found that takin and serow occurrences were negatively associated with gathering while we detected no significant correlated between gathering and grazing and the abundance of some medium-sized mammal species(including musk deer,tufted deer,leopard cat and marten).At site-specific scales,blues sheep abundances were associated with alpine screes,serow and takin abundances were affected by canopy cover and distance to water sources,musk deer abundances were associated with oak shrubs,oak forests and open canopy cover,while tufted deer avoided oak *** species habitat associations were unspeceialised and showed no significant associations with habitat variables(leopard cat,marten and goral).High tolerant of medium-sized mammal species to gathering and grazing might be related to their nocturnal *** results showed large-sized mammals were more fragile to human disturbances and required higher cover conditions which might be relate to their unique life histories such as easy to be detected by predator including poachers,high energy requirements and low *** recommend rigorously control gathering and grazing in protected areas distributed with large-sized mammals,even for th

关键词： Camera trapping for mammal species in mountain forests correlates of trapping rate and human presence

来源：评论

学校读者我要写书评

暂无评论

Guided installation of basic linear algebra routines in a cluster with manycore components

引用

CONCURRENCY AND COMPUTATION-PRACTICE & EXPERIENCE 2017年第15期29卷

作者： Cuenca, J. Garcia, L. P. Gimenez, D. Herrera, F. J. Univ Murcia Dept Engn & Technol Comp Murcia Spain Tech Univ Cartagena Serv Support Technol Res Murcia Spain Univ Murcia Dept Comp & Syst Murcia Spain

Computational systems are nowadays composed of basic computational components that share multiprocessors and coprocessors of different types, typically several graphics processing units (GPUs) or many integrated cores (MICs), and those computational components are combined in heterogeneous clusters of nodes with different characteristics, including coprocessors of different types, with varying numbers of nodes at different speeds. the software previously developed and optimized for simpler system needs to be redesigned and reoptimized for these new, more complex systems. the adaptation to hybrid multicore+multiGPU and multicore+multiMIC of autotuning techniques for basic linear algebra routines is analyzed. the matrix-matrix multiplication kernel, which is optimized for different computational system components through guided experimentation, is studied. the routine is installed for each node in the cluster, and the information generated from individual installations may be used for a hierarchical installation in a cluster. the basic matrix-matrix multiplication may, in turn, be used inside higher level routines, which delegate their efficient execution to the optimization of the lower level routine. Experimental results are satisfactory in different multicore+multiGPU and multicore+multiMIC systems. So the guided search of execution configurations for satisfactory execution times proves to be a useful tool for heterogeneous systems, where the complexity of the system means a correct use of highly efficient routines and libraries is difficult.

关键词： autotuning heterogeneous computing hybrid programming parallel linear algebra manycore

来源：评论

学校读者我要写书评

暂无评论

Methods for multitasking among real-time embedded compute tasks running on the GPU

引用

CONCURRENCY AND COMPUTATION-PRACTICE & EXPERIENCE 2017年第15期29卷 1-14页

作者： Muyan-Ozcelik, Pinar Owens, John D. Calif State Univ Sacramento Sacramento CA 95819 USA Univ Calif Davis Davis CA 95616 USA

In this study, we provide an extensive survey on wide spectrum of scheduling methods for multitasking among graphics processing unit (GPU) computing tasks. We then design several schedulers and explain in detail the selected methods we have developed to implement our scheduling strategies. Next, we compare the performance of schedulers on various workloads running on Fermi and Kepler architectures and arrive at the following major conclusions: (1) Small kernels benefit from running kernels concurrently. (2) the combination of small kernels, high-priority kernels with longer runtimes, and lower-priority kernels with shorter runtimes benefits from a CPU scheduler that dynamically changes kernel order on the Fermi architecture. (3) Because of limitations of existing GPU architectures, currently CPU schedulers outperform their GPU counterparts. We also provide results and observations obtained from implementing and evaluating our schedulers on the NVIDIA Jetson TX1 system-on-chip architecture. We observe that although TX1 has the newer Maxwell architecture, the mechanism used for scheduler timings behaves differently on TX1 compared to Kepler leading to incorrect timings. In this paper, we describe our methods that allow us to report correct timings for CPU schedulers running on TX1. Finally, we propose new research directions involving the investigation of additional scheduling strategies.

关键词： GPU computing multitasking real-time embedded tasks

来源：评论

学校读者我要写书评

暂无评论

JParEnt: parallel entropy decoding for JPEG decompression on heterogeneous multicore architectures

引用

CONCURRENCY AND COMPUTATION-PRACTICE & EXPERIENCE 2017年第15期29卷

作者： Sodsong, Wasuwee Jung, Minyoung Park, Jinwoo Burgstaller, Bernd Yonsei Univ Dept Comp Sci Seoul South Korea

the JPEG format employs Huffman codes to compress the entropy data of an image. Huffman codewords are of variable length, which makes parallel entropy decoding a difficult problem. To determine the start position of a codeword in the bitstream, the previous codeword must be decoded first. We present JParEnt, a new approach to parallel entropy decoding for JPEG decompression on heterogeneous multicores. JParEnt conducts JPEG decompression in two steps: (1)an efficient sequential scan of the entropy data on the CPU to determine the start-positions (boundaries) of coefficient blocks in the bitstream, followed by (2)a parallel entropy decoding step on the graphics processing unit (GPU). the block boundary scan constitutes a reinterpretation of the Huffman-coded entropy data to determine codeword boundaries in the bitstream. We introduce a dynamic workload partitioning scheme to account for GPUs of low compute power relative to the CPU. this configuration has become common with the advent of SoCs with integrated graphics processors (IGPs). We leverage additional parallelism through pipelined execution across CPU and GPU. For systems providing a unified address space between CPU and GPU, we employ zero-copy to completely eliminate the data transfer overhead. Our experimental evaluation of JParEnt was conducted on six heterogeneous multicore systems: one server and two desktops with dedicated GPUs, one desktop with an IGP, and two embedded systems. For a selection of more than 1000JPEG images, JParEnt outperforms the SIMD-implementation of the libjpeg-turbo library by up to a factor of 4.3x, and the previously fastest JPEG decompression method for heterogeneous multicores by up to a factor of 2.2x. JParEnt's entropy data scan consumes 45% of the entropy decoding time of libjpeg-turbo on average. Given this new ratio for the sequential part of JPEG decompression, JParEnt achieves up to97% of the maximum attainable speedup (95% on average). On the IGP-based desktop platform,

关键词： JPEG decoding entropy decoding prefix codes heterogeneous multicores GPU programming

来源：评论

学校读者我要写书评

暂无评论

6th international workshop on performance modeling, evaluation, and optimization of parallel and distributed systems (PMEO-PDS'07)

Proceedings - 21st International Parallel and Distributed Pr...

引用

Proceedings - 21st international parallel and distributed Processing symposium, IPDPS 2007;Abstracts and CD-ROM 2007年

作者： Min, Geyong Ould-Khaoua, Mohamed Jin, Xiaolong Notare, Mirela Sechi Moretti Annoni Al-Begain, K. Al-Dubai, A. Arabnia, H.R. Awan, I. Boukerche, A. Bradley, J. Cockshott, P. Colajanni, M. Day, K. Djemame, K. El-Ghazawi, T. Fatoohi, R. Gelenbe, E. Gueroui, M. He, X. Ibbett, R. Jarvis, S. Jin, X. Karatza, H. Katangur, A. Khonsari, A. Knottenbelt, W. Li, K. Liu, H. Loucif, S. Mackenzie, L.M. Pan, Y. Pradhan, D.K. Qin, X. Sarbazi-Azad, H. Shahrabi, A. Song, E. Sun, X.H. thomas, N. Touzene, A. Wang, X. Woodward, M. Wu, J. Xiao, L. Xie, T. Xu, C.Z. Xu, Z. Yan, S. Yang, L.T. Zhou, X. Zomaya, A. Department of Computing University of Bradford Bradford BD7 1DP United Kingdom Department of Computing Science University of Glasgow Glasgow G12 8RZ United Kingdom Barddal University Florianópolis SC Brazil Univ. of Glamorgan United Kingdom Napier Univ. United Kingdom Univ. of Georgia United States Univ. of Bredford United Kingdom Univ. of North Texas United States Imperial College London United Kingdom Univ. of Glasegow United Kingdom Univ. of Modena Italy Sultan Qaboas Univ. Oman Univ. of Leeds United Kingdom George Washington University United States San Jose State University United States University of Cergy-Pontoise France Tennessee Technological Univ. United States Univ. of Edinburgh United Kingdom Univ. of Warwick United Kingdom Univ. of Thessaloniki Greece Texas AandM Univ. United States IPM Iran Imperiel College London United Kingdom State Univ. of New York New Paltz NY United States Huazhoang Univ. of Science and Technology China Emirates University United Arab Emirates Univ. of Glasgow United Kingdom Georgia State Univ. United States Univ. of Bristol United Kingdom New Mexico Inst. of Maining and Technology United States Sharif Univ. and IPM Iran Glasgow Caledonian Univ. United Kingdom Huazhong Univ. of Science and Technology China Illinois Institute of Technology United States Univ. of Newcastle United Kingdom Sultan Qaboes Univ. Oman Villanova Univ. United States Univ. of Bradford United Kingdom Florida Atlantic Univ. United States Michigan State Univ. United States San Diego State University United States Wayne State Univ. United States Suffolk Univ. United States St Francis Xavier Univ. Canada University of Colorado Colorado Springs CO United States Univ. of Sydney Australia

No abstract available

ISBN: (纸本)1424409101

No abstract available

关键词：

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：