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

international conference on Computer and Information Sciences (ICCOINS)

作者： Yussiff, Abdul-Lateef Yong, Suet-Peng Baharudin, Baharum B. Univ Teknol PETRONAS Dept Comp & Informat Sci Tronoh Perak Malaysia

ISBN: (纸本)9781479943913

A novel approach to robust and flexible person tracking using an algorithm that integrates state of the arts techniques;an Enhanced Person Detector (EPD) and Kalman filtering algorithm. This proposed algorithm employs multiple instances of Kalman Filter with complex assignment constraints using Graphics processing Unit (GPU-NVDIA CUDA) as a parallel computing environment for tracking multiple persons even in the presence of occlusion. A Kalman filter is a recursive algorithm which predict the state variables and further uses the observed data to correct the predicted value. Data association in different frames are solved using Hungarian technique to link data in previous frame to the current frame. The benefit of this research is an adoption of standard Kalman Filter for multiple target tracking of humans in real time. This can further be used in all applications where human tracking is needed. The parallel implementation has increased the frame processing speed by 2030 percent over the CPU implementation.

关键词： Human Tracking Kalman Filter Multi-person Tracking

来源：评论

学校读者我要写书评

暂无评论

distributed Program Execution Control Based on Application Global States Monitoring in PEGASUS DA Framework

Distributed Program Execution Control Based on Application G...

引用

10th international conference on parallel processing and Applied Mathematics (PPAM)

作者： Kopanski, Damian Masko, Lukasz Laskowski, Eryk Smyk, Adam Borkowski, Janusz Tudruj, Marek Polish Japanese Inst Informat Technol Ul Koszykowa 86 PL-02008 Warsaw Poland Polish Acad Sci Inst Comp Sci PL-01248 Warsaw Poland

ISBN: (纸本)9783642552243

This paper presents control implementation methods for an original distributed program design framework PEGASUS DA (Program Execution Governed by Asynchronous SUpervision of States in distributed applications) which provides automated design of distributed program execution control based on program global states monitoring. The framework includes a built in support for handling local and global application states as well as automatic construction and use of strongly consistent application global states for program execution control. In particular, the paper presents methods used to implement distributed program control inside the PEGASUS DA framework run on clusters of contemporary multicore processors based on multithreading. The program design method is illustrated on a distributed multithreaded application executed with load balancing in a multicore system.

关键词： distributed program execution control distributed program design Global application states Strongly consistent global states Program design tools

来源：评论

学校读者我要写书评

暂无评论

Cybertron: Pushing the Limit on I/O Reduction in Data-parallel Programs

引用

ACM SIGPLAN NOTICES 2014年第10期49卷 895-908页

作者： Xiao, Tian Guo, Zhenyu Zhou, Hucheng Zhang, Jiaxing Zhao, Xu Ye, Chencheng Wang, Xi Lin, Wei Chen, Wenguang Zhou, Lidong Tsinghua Univ Beijing Peoples R China Univ Toronto Toronto ON M5S 1A1 Canada Huazhong Univ Sci & Technol Wuhan Peoples R China MIT CSAIL Cambridge MA USA

I/O reduction has been a major focus in optimizing dataparallel programs for big-data processing. While the current state-of-the-art techniques use static program analysis to reduce I/O, Cybertron proposes a new direction that incorporates runtime mechanisms to push the limit further on I/O reduction. In particular, Cybertron tracks how data is used in the computation accurately at runtime to filter unused data at finer granularity dynamically, beyond what current staticanalysis based mechanisms are capable of, and to facilitate a new mechanism called constraint based encoding for more efficient encoding. Cybertron has been implemented and applied to production data-parallel programs;our extensive evaluations on real programs and real data have shown its effectiveness on I/O reduction over the existing mechanisms at reasonable CPU cost, and its improvement on end-to-end performance in various network environments.

关键词： MapReduce data-parallel execution-equivalent I/O reduction

来源：评论

学校读者我要写书评

暂无评论

Faster parallel Traversal of Scale Free Graphs at Extreme Scale with Vertex Delegates 14

Faster Parallel Traversal of Scale Free Graphs at Extreme Sc...

引用

international conference on High Performance Computing, Networking, Storage and Analysis

作者： Pearce, Roger Gokhale, Maya Amato, Nancy M. Lawrence Livermore Natl Lab Ctr Appl Sci Comp Livermore CA 94550 USA Texas A&M Univ Dept Comp Sci & Engr Parasol Lab College Stn TX USA

ISBN: (纸本)9781479955008

At extreme scale, irregularities in the structure of scale-free graphs such as social network graphs limit our ability to analyze these important and growing datasets. A key challenge is the presence of high-degree vertices (hubs), that leads to parallel workload and storage imbalances. The imbalances occur because existing partitioning techniques are not able to effectively partition high-degree vertices. We present techniques to distribute storage, computation, and communication of hubs for extreme scale graphs in distributed memory supercomputers. To balance the hub processing workload, we distribute hub data structures and related computation among a set of delegates. The delegates coordinate using highly optimized, yet portable, asynchronous broadcast and reduction operations. We demonstrate scalability of our new algorithmic technique using Breadth-First Search (BFS), Single Source Shortest Path (SSSP), K-Core Decomposition, and Page-Rank on synthetically generated scale-free graphs. Our results show excellent scalability on large scale-free graphs up to 131K cores of the IBM BG/P, and outperform the best known Graph500 performance on BG/P Intrepid by 15%.

关键词： data structures distributed memory systems graph theory parallel machines tree searching BFS IBM BG-P Page-Rank SSSP asynchronous broadcast operations breadth-first search distributed memory supercomputers extreme scale graphs high-degree vertices hub data structures k-core decomposition parallel workload scale free graph parallel traversal single source shortest path social network graphs storage imbalances Algorithm design and analysis Benchmark testing Computational modeling Data structures Partitioning algorithms Scalability Supercomputers Data structures supercomputer Algorithm design and analysis distributed memory systems Benchmark testing Tree searching Scalability Partitioning algorithms parallel machines Computational modeling breadth first search Graph theory HUB BUNDESAMT FUER STRAHLENSCHUTZ

来源：评论

学校读者我要写书评

暂无评论

Performance analysis of MapReduce-based distributed systems for iterative data processing applications

Performance analysis of MapReduce-based distributed systems ...

引用

4th international conference on Mobile, Ubiquitous, and Intelligent Computing, MUSIC 2013

作者： Yoon, Min Kim, Hyeong-Il Choi, Dong Hoon Jo, Heeseung Chang, Jae-Woo Dept. of Computer Engineering Chonbuk National University Jeonju Korea Republic of Korea Institute of Science and Technology Information Daejeon Korea Republic of

ISBN: (纸本)9783642406744

Recently, research on big data has been actively made because big data are generated in various scientific applications, such as biology and astronomy. Therefore, distributed data processing techniques have been studied to manage the big data in large number servers. Meanwhile, some scientific applications like genome data analysis require loop control in analyzing big data using a MapReduce framework. In this paper, we first describe the existing MapReduce-based distributed systems which support iterative data processing. In addition, we do the performance analysis of the existing distributed systems in terms of execution time for various scientific applications which require iterative data processing. Finally, based on the performance analysis, we discuss some requirements for a new MapReduce-based distributed system which supports iterative data processing efficiently. © Springer-Verlag Berlin Heidelberg 2014.

关键词： MapReduce

来源：评论

学校读者我要写书评

暂无评论

Hybrid MPI/OpenMP/OpenACC implementations for the solution of convection-diffusion equations with the HOPMOC Method 14

Hybrid MPI/OpenMP/OpenACC implementations for the solution o...

引用

14th international conference on Computational Science and Its applications (ICCSA)

作者： Cabral, Frederico Luis Osthoff, Carla Brandao, Diego Kischinhevsky, Mauricio Ctr Comp Alto Desempenho LNCC Petropolis RJ Brazil CEFET RJ Ctr Fed Educ Tecnol Colegiado Informat Nova Iguacu RJ Brazil Univ Fed Fluminense Inst Comp Niteroi RJ Brazil

ISBN: (纸本)9781479942640

The need for fast solution of large scientific and industrial problems has long motivated the quest for improvements both in software as well as in hardware, since the inception of computing tools. In this context, vectorization, parallelization of tasks have been important strategies for the improvement of hardware efficiency during the last decades. Operator splitting techniques for the numerical solution of partial differential equations are also an attempt towards the same goal, on the software side. This work presents two parallel implementations of the Hopmoc method to solve parabolic equations with convective dominance on a cluster with multiple multicore nodes or GPUs. The Hopmoc method is based both on the modified method of characteristics and the Hopscotch method. It is implemented through an explicit-implicit operator splitting technique. Hopmoc has been studied on distributed memory machines under MPI. In this work Hopmoc is implemented on clusters of multiple cores or GPUs in one single programming model. Previous results had shown that Hopmoc is a scalable parallel procedure with respect to distributed memory machines. New numerical results of the technique presented herein show performance improvements of up to 300 times when compared with the sequential version.

关键词： parallel computing Hopmoc method convection-diffusion equation

来源：评论

学校读者我要写书评

暂无评论

Increasing the Efficiency and Responsiveness of Mobile applications with Preemptable Code Offloading 3

Increasing the Efficiency and Responsiveness of Mobile Appli...

引用

3rd IEEE international conference on Mobile Services (MS)

作者： Berg, Florian Duerr, Frank Rothermel, Kurt Univ Stuttgart Inst Parallel & Distributed Syst D-70569 Stuttgart Germany

ISBN: (纸本)9781479950607

Mobile applications are getting more and more sophisticated and demanding. Although the processing, memory, and storage resources of mobile devices are constantly increasing to enable such resource-demanding mobile applications, battery capacity is still the main limiting factor. To solve this problem, mobile code offloading approaches can be used to offload parts of a mobile application to remote servers and utilize the resources of cloud services. In this paper, we propose a novel code offloading approach that makes code offloading robust against communication link failures, which are still a major problem of mobile systems. To this end, we propose preemptable code offloading. It allows for interrupting the offloading process and continuing the remote execution locally after a link failure, without abandoning the complete result calculated remotely so far. The basic idea of our approach is to create safe-points of the remote execution and transmit these intermediate results back to the mobile device. After a link failure, the mobile device can now continue execution from the last transmitted safe-point. Although safe-points induce communication and energy overhead, our evaluations show that using an optimized safe-point schedule this overhead quickly pays off under link failures. Besides reducing the overall energy consumption significantly, responsiveness also benefits from safe-points by meeting given execution deadlines after link failures.

关键词： distributed Systems Code Offloading Safe-points Mobile Cloud Computing Efficiency Responsiveness

来源：评论

学校读者我要写书评

暂无评论

Using NP-complete problems to compare a CPU, GPU, and the Intel® Xeon Phi™ coprocessor

Using NP-complete problems to compare a CPU, GPU, and the In...

引用

12th IASTED international conference on parallel and distributed Computing and Networks, PDCN 2014

作者： Toth, David M. Goodwyn, Zachary Mueller, Jerome University of Mary Washington 1301 College Avenue Fredericksburg VA 22401 United States

As accelerators are integrated into many of the newest workstations and supercomputers to provide large amounts of additional processing power, selecting the appropriate one is critical for achieving the best performance. The new Intel® Xeon® Phi™ coprocessor provides more processing cores than a CPU but less than a graphics processing unit (GPU). However, the Phi's cores do not have the limitations of a GPU's cores and can also run code written for traditional CPUs instead of requiring code written specifically for GPUs. We used the traveling salesman problem, the knapsack problem, and the party problem, three NP-complete problems, as benchmark applications to compare the relative performance of the Phi with a contemporary GPU and CPU. Programs were written to solve the problems on the CPU and on the coprocessor that could be easily ported to run on the GPU with only minor modifications. The length of time the programs took to complete on the coprocessor, the GPU, and the CPU was measured. While the GPU attained speedups of almost 14 to 80 over a single CPU core for the problems, the coprocessor only attained speedups between 4 and 7 for the problems.

关键词： Graphics processing unit

来源：评论

学校读者我要写书评

暂无评论

Internet of Mobile Things: Challenges and Opportunities 14

Internet of Mobile Things: Challenges and Opportunities

引用

23rd international conference on parallel Architectures and Compilation techniques (PACT)

作者： Nahrstedt, Klara Univ Illinois Dept Comp Sci 1304 W Springfield Ave Urbana IL 61801 USA Univ Illinois Coordinated Sci Lab Coll Engn Urbana IL 61801 USA

ISBN: (纸本)9781450328098

The Internet of Things (IoT) concept has been around for some time and applications such as transportation, health-care, education, travel, smart grid, retail, are and will be major benefactors of this concept. However, only recently, due to technological advances in sensor devices and rich wireless connectivity, Internet of Things at scale is becoming reality. For example, Cisco's Internet of Things Group predicts over 50 billion connected sensory devices by 2020. In this talk, we will discuss the Internet of Mobile Things (IoMT) since several game-changing technological advances happened on mobile things' such as mobile phones, trains, and cars, where rich sets of sensors, connected via diverse sets of wireless Internet technologies, are changing and influencing how people communicate, move, and download and distribute information. In this space, challenges come from the needs to determine (1) contextual information such as location, duration of contact, density of devices, utilizing networked sensory information;(2) higher level knowledge such as users' activity detection, mood detection, applications usage pattern detection and user interactions on 'mobile things', utilizing contextual information;and (3) adaptive and real-time parallel and distributed architectures that integrate context, activity, mood, usage patterns into mobile application services on mobile 'things'. Solving these challenges will provide enormous opportunities to improve the utility of mobile 'things', optimizing scarce resources on mobile 'things' such as energy, memory, and bandwidth.

关键词： Internet of Things Mobile Computing Context Management Activity Detection Adaptive parallel and distributed Architectures and Systems

来源：评论

学校读者我要写书评

暂无评论

WSN implementation of DFD algorithm on SOFREL S550/WAVENIS Unit 15

WSN implementation of DFD algorithm on SOFREL S550/WAVENIS U...

引用

15th international conference on Sciences and techniques of Automatic Control and Computer Engineering (STA)

作者： Saihi, Marwa Boussaid, Boumedyen Zouinkhi, Ahmed Abdelkrim, M. Naceur Gabes Univ Natl Sch Engineers Gabes MACS Res Unit O Khattab Rd Gabes 6029 Tunisia

ISBN: (纸本)9781479959075

Wireless Sensor Networks (WSN) can experience faults during deployment either due to its hardware malfunctioning or software failure or even harsh environmental factors. This results into presence of anomalies in their time-series collected data. So, these anomalies demand for reliable detection strategies to support in long term and/or in large scale WSN deployments. These data of physical variables are transmitted continuously to a repository for further processing of information as data stream. centralized fault detection based on centralized approach has become an emerging technology for building scalable and energy balanced applications for WSN. In our work, we try to implement the distributed Fault Detection (DFD) algorithm in a central unit named SOFREL S550 which represent the base station or the sink node and detects the suspicious nodes by exchanging heartbeat messages in active manner. By analyzing the collected heartbeat information, the unit finally identifies failed nodes according to a pre-defined failure detection rule.

关键词： Wireless Sensor Network distributed Fault Detection Decentralized approach Centralized approach

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：