Filters








80,129 Hits in 5.5 sec

Parallel Computing Based Dynamic Programming Algorithm of Track-before-Detect

Qiang Guo, Zhenwu Li, Wenming Song, Wenyu Fu
2018 Symmetry  
The conventional dynamic programming-based track-before-detect (DP-TBD) methods are usually intractable in multi-target scenarios.  ...  Simulations are conducted to verify the superiority of the proposed PC-DP-TBD in terms of detection probability and computational complexity.  ...  Acknowledgments: The authors would like to thank the Editors and the reviewers for their comments on a draft of this article. Conflicts of Interest: The authors declare no conflict of interest.  ... 
doi:10.3390/sym11010029 fatcat:gmha5mzg7zd23c7ixrlaobvg2m

Scalable and precise dynamic datarace detection for structured parallelism

Raghavan Raman, Jisheng Zhao, Vivek Sarkar, Martin Vechev, Eran Yahav
2012 Proceedings of the 33rd ACM SIGPLAN conference on Programming Language Design and Implementation - PLDI '12  
Existing dynamic race detectors suffer from at least one of the following three limitations: (i) space overhead per memory location grows linearly with the number of parallel threads [13] , severely limiting  ...  Our algorithm requires constant space per memory location, works in parallel, and is efficient in practice. We implemented and evaluated our algorithm on a set of 15 benchmarks.  ...  Acknowledgments We are grateful to the authors of the RoadRunner tool [14] , Cormac Flanagan and Stephen Freund, for sharing their implementation of FastTrack that was used to obtain the results reported  ... 
doi:10.1145/2254064.2254127 dblp:conf/pldi/RamanZSVY12 fatcat:n5mvqmh4g5frrbvhexvsoqf6lu

Scalable and precise dynamic datarace detection for structured parallelism

Raghavan Raman, Jisheng Zhao, Vivek Sarkar, Martin Vechev, Eran Yahav
2012 SIGPLAN notices  
Existing dynamic race detectors suffer from at least one of the following three limitations: (i) space overhead per memory location grows linearly with the number of parallel threads [13] , severely limiting  ...  Our algorithm requires constant space per memory location, works in parallel, and is efficient in practice. We implemented and evaluated our algorithm on a set of 15 benchmarks.  ...  Acknowledgments We are grateful to the authors of the RoadRunner tool [14] , Cormac Flanagan and Stephen Freund, for sharing their implementation of FastTrack that was used to obtain the results reported  ... 
doi:10.1145/2345156.2254127 fatcat:defsbudcwba3devgqofmnfzupm

Dual-Module Data Fusion of Infrared and Radar for Track Before Detect

Anfu Zhu, Yunfei Li, Lingling Lv, Hongtao Zhang
2012 Journal of Computers  
A track before detect method based on data fusion of infrared and radar is proposed to increase the probability of correct track initiation and shorten initiation time.  ...  Particle filter and dynamic programming for track before detect are currently proposed for detecting and tracking dim targets in low signal-to-noise ratio background.  ...  ACKNOWLEDGMENT The authors gratefully acknowledge the support of the National Natural Science Foundation of China (31101085).  ... 
doi:10.4304/jcp.7.12.2861-2867 fatcat:jhazju5o7bcghiaclxdhftij24

Efficient Data Race Detection of Async-Finish Programs Using Vector Clocks [article]

Shivam Kumar and Anupam Agrawal and Swarnendu Biswas
2021 arXiv   pre-print
This work shows how to efficiently apply vector clocks for dynamic race detection of async-finish programs with locks.  ...  FastRacer also exploits the structured parallelism of async-finish programs to use a coarse-grained encoding of the dynamic task inheritance to limit the metadata in the presence of many concurrent readers  ...  This material is based upon work supported by IITK Initiation Grant and Science and Engineering Research Board under Grant SRG/2019/000384.  ... 
arXiv:2112.04352v1 fatcat:blz53bufjrdi7jasrjbw7mqxhq

Target container: A target-centric parallel programming abstraction for video-based surveillance

Kirak Hong, Stephen Smaldone, Junsuk Shin, David Lillethun, Liviu Iftode, Umakishore Ramachandran
2011 2011 Fifth ACM/IEEE International Conference on Distributed Smart Cameras  
The key insight is to allow the domain expert (e.g., a vision researcher) to focus on the algorithmic details of target tracking and let the system deal with providing the computational resources (cameras  ...  We introduce a novel abstraction, the target container (TC), which serves as a parallel programming model and execution framework for developing complex applications for tracking multiple targets in a  ...  In the tracker, color track function computes the new position of the target using a blob-tracking algorithm from the OpenCV library.  ... 
doi:10.1109/icdsc.2011.6042914 dblp:conf/icdsc/HongSSLIR11 fatcat:5ebodq2qsrgn5jxtpuxmwxl4wy

Managing Algorithmic Skeleton Nesting Requirements in Realistic Image Processing Applications: The Case of the SKiPPER-II Parallel Programming Environment's Operating Model

Rémi Coudarcher, Florent Duculty, Jocelyn Serot, Frédéric Jurie, Jean-Pierre Derutin, Michel Dhome
2005 EURASIP Journal on Advances in Signal Processing  
The main goal of the project was to demonstrate the applicability of skeleton-based parallel programming techniques to the fast prototyping of reactive vision applications.  ...  SKiPPER is a Skeleton-based Parallel Programming EnviRonment being developed since 1996 and running at LASMEA Laboratory, the Blaise-Pascal University, France.  ...  of the Department of Computing and Electrical Engineering, the Heriot-Watt University, Edinburgh, Scotland.  ... 
doi:10.1155/asp.2005.1005 fatcat:on4yxntjyvgf5j5t6243yrjg2a

Parallel Hybrid Testing Techniques for the Dual-Programming Models-Based Programs

Ahmed Mohammed Alghamdi, Fathy Elbouraey Eassa, Maher Ali Khamakhem, Abdullah Saad AL-Malaise AL-Ghamdi, Ahmed S. Alfakeeh, Abdullah S. Alshahrani, Ala A. Alarood
2020 Symmetry  
Finally, ACC_TEST is a parallel testing tool that creates testing threads based on the number of application threads for detecting runtime errors.  ...  The importance of high-performance computing is increasing, and Exascale systems will be feasible in a few years.  ...  Conflicts of Interest: The authors declare that they have no conflicts of interest.  ... 
doi:10.3390/sym12091555 doaj:357eb376d21d4cdabd7ec942dd5230ee fatcat:s43om3wibrbhba2u5f5xmc2z3y

A system on chip-based real-time tracking system for amphibious spherical robots

Shuxiang Guo, Shaowu Pan, Xiaoqiong Li, Liwei Shi, Pengyi Zhang, Ping Guo, Yanlin He
2017 International Journal of Advanced Robotic Systems  
Aiming at vision applications of our amphibious spherical robot, a real-time detection and tracking system adopting Gaussian background model and compressive tracking algorithm was designed and implemented  ...  (RISC) machine and field programmable gate array was proposed on the basis of Zynq-7000 system on chip.Under the architecture, main parts of the vision algorithms were implemented as software programs  ...  Declaration of conflicting interests The author(s) declared no potential conflicts of interest with respect to the research, authorship and/or publication of this article.  ... 
doi:10.1177/1729881417716559 fatcat:mezol6kpxrfkvcwb3jcwwnujqy

Foreword to special section on VRIPHYS 2015

Fabrice Jaillet, Florence Zara, Gabriel Zachmann
2016 Computers & graphics  
His research includes computational geometry, animation for computer graphics, topological and physicallybased modeling of 3D deformable objects, biomechanical simulation of soft tissues, parallel algorithms  ...  Science department, IUT Lyon1, and is now deputyhead of the SAARA research team.  ...  [2] presents a parallel implementation of a meshbased surface tracker running on the GPU using recent features like dynamic parallelism.  ... 
doi:10.1016/j.cag.2016.04.002 fatcat:e2kecwfhjrbytpr7da4mpe5fau

Optimizing Dynamic Resource Allocation

Lucas W. Krakow, Louis Rabiet, Yun Zou, Guillaume Iooss, Edwin K.P. Chong, Sanjay Rajopadhye
2014 Procedia Computer Science  
We present a formulation, solution method, and program acceleration techniques for two dynamic control scenarios, both with the common goal of optimizing resource allocations.  ...  A novel aspect is included in the second scenario: dynamically allocating the computational resources in an online fashion which is made possible through constant aspect ratio tiling (CART).  ...  the tracking algorithms.  ... 
doi:10.1016/j.procs.2014.05.115 fatcat:xe42jy2q4jg5raeokutw75jhuq

Scalable dynamic information flow tracking and its applications

Rajiv Gupta, Neelam Gupta, Xiangyu Zhang, Dennis Jeffrey, Vijay Nagarajan, Sriraman Tallam, Chen Tian
2008 Proceedings, International Parallel and Distributed Processing Symposium (IPDPS)  
We are designing scalable dynamic information flow tracking techniques and employing them to carry out tasks related to debugging (bug location and fault avoidance), security (software attack detection  ...  The focus of our ongoing work is on developing online dynamic analysis techniques for long running multithreaded programs that may be executed on a single core or on multiple cores to exploit thread level  ...  Introduction Dynamic Information Flow Tracking (DIFT) is a promising technique that tracks the flow of information along dynamic dependences starting from the program inputs to the values computed by the  ... 
doi:10.1109/ipdps.2008.4536382 dblp:conf/ipps/GuptaGZJNTT08 fatcat:adkkludfwvdejkfra3mitwlmiq

PaRV: Parallelizing Runtime Detection and Prevention of Concurrency Errors [chapter]

Ismail Kuru, Hassan Salehe Matar, Adrián Cristal, Gokcen Kestor, Osman Unsal
2013 Lecture Notes in Computer Science  
We present the PaRV tool for runtime detection of and recovery from data races in multi-threaded C and C++ programs.  ...  Application threads are slowed down only due to instrumentation, but not due to the computation performed by runtime verification algorithms since the latter are run concurrently on different threads.  ...  PaRV addresses this problem by adding synchronization to the program as needed. Second, race detection in Frost is imprecise. PaRV uses the FastTrack algorithm for precise detection of races.  ... 
doi:10.1007/978-3-642-35632-2_6 fatcat:abceyf5mwbe2tf4sgp22n7f5b4

Sub-optimal solutions to track detection problem using graph theoretic concepts

Stavros D. Nikolopoulos, George Samaras
1997 Journal of systems architecture  
We focus on modeling the track detection problem in terms of a graph, formulating fast sequential/parallel sub-optimal track detection algorithms and testing them on simulated data in order to show their  ...  weighted graph model and how dynamic programming techniques can be efficiently applied to reach an optimal or sub-optimal solution.  ...  Ianniello of SACLANT Undersea Research Center for his assistance with various parts of this work and Dr. R. Strait of Naval Underwater System Center for enlightening conversations on this subject.  ... 
doi:10.1016/s1383-7621(96)00074-4 fatcat:5cifjfrlgnfh7lup2pgtn5fsdm

SKiPPER: A Skeleton-Based Parallel Programming Environment for Real-Time Image Processing Applications [chapter]

Jocelyn Sérot, Dominique Ginhac, Jean-Pierre Dérutin
1999 Lecture Notes in Computer Science  
SKiPPER is based upon the concept of algorithmic skeletons, i.e. higher order program constructs encapsulating recurring forms of parallel computations and hiding their low-level implementation details  ...  This paper presents SKiPPER, a programming environment dedicated to the fast prototyping of parallel vision algorithms on MIMD-DM platforms.  ...  S u c h \looping" patterns are very commonin tracking algorithms, based upon system-state prediction, such a s t h e o n e p r e s e n ted in section 4.  ... 
doi:10.1007/3-540-48387-x_31 fatcat:aka3f3owtjfzhbezqblqsvrmfe
« Previous Showing results 1 — 15 out of 80,129 results