Filters








1,159 Hits in 5.6 sec

Eliminating race conditions in system-level models by using parallel simulation infrastructure

Weiwei Chen, Che-Wei Chang, Xu Han, Rainer Domer
2012 2012 IEEE International High Level Design Validation and Test Workshop (HLDVT)  
We propose to use advanced conflict analysis in the compiler, fast checking in a parallel simulator, and a novel race-condition diagnosis tool, that not only exposes all race conditions, but also locates  ...  For a top-down system design flow, a well-written specification model of an embedded system is crucial for its successful design and implementation.  ...  ACKNOWLEDGMENT This work has been supported in part by funding from the National Science Foundation (NSF) under research grant NSF Award #0747523. The authors thank the NSF for the valuable support.  ... 
doi:10.1109/hldvt.2012.6418253 dblp:conf/hldvt/ChenCHD12 fatcat:jlmsyaxkcbcuvi32a54w4bbk5a

An embedded computer cluster for controlling an autonomous unmanned air vehicle crane

Constantino Gonçalves Ribeiro, Luciano Santos Constantin Raptopoulos, Max Suell Dutra
2017 Application and Theory of Computer Technology  
A simulator was used to reproduce new evasion procedures and a new parallel / distributed program for optimal path discover was developed and used in the embedded cluster prototype.  ...  In many applications is more expensive use UAVs than the original equipment.  ...  The sequential and parallel/distributed execution run times for 8, 16, 32, 64 and 128 best path targets were plotted into Table 3 and the results show a speed of execution time of the parallel/distributed  ... 
doi:10.22496/atct20170208141 fatcat:fno6egqfwvff5axqnvvyuyuf4a

The tao of parallelism in algorithms

Keshav Pingali, Mario Méndez-Lojo, Dimitrios Prountzos, Xin Sui, Donald Nguyen, Milind Kulkarni, Martin Burtscher, M. Amber Hassaan, Rashid Kaleem, Tsung-Hsien Lee, Andrew Lenharth, Roman Manevich
2011 SIGPLAN notices  
For more than thirty years, the parallel programming community has used the dependence graph as the main abstraction for reasoning about and exploiting parallelism in "regular" algorithms that use dense  ...  In this paper, we argue that the dependence graph is not a suitable abstraction for algorithms in new application areas like machine learning and network analysis in which the key data structures are "  ...  This class of algorithms may benefit from mechanisms like transactional memory that use more sophisticated conflict detection policies [29] ; in fact, the parallelization of red-black tree operations  ... 
doi:10.1145/1993316.1993501 fatcat:yb5dohajnvghraddonquk5iyua

The tao of parallelism in algorithms

Keshav Pingali, Mario Méndez-Lojo, Dimitrios Prountzos, Xin Sui, Donald Nguyen, Milind Kulkarni, Martin Burtscher, M. Amber Hassaan, Rashid Kaleem, Tsung-Hsien Lee, Andrew Lenharth, Roman Manevich
2011 Proceedings of the 32nd ACM SIGPLAN conference on Programming language design and implementation - PLDI '11  
For more than thirty years, the parallel programming community has used the dependence graph as the main abstraction for reasoning about and exploiting parallelism in "regular" algorithms that use dense  ...  In this paper, we argue that the dependence graph is not a suitable abstraction for algorithms in new application areas like machine learning and network analysis in which the key data structures are "  ...  This class of algorithms may benefit from mechanisms like transactional memory that use more sophisticated conflict detection policies [29] ; in fact, the parallelization of red-black tree operations  ... 
doi:10.1145/1993498.1993501 dblp:conf/pldi/PingaliNKBHKLLMMPS11 fatcat:blbfrhd5zffw7npa26wznr4nfq

The tao of parallelism in algorithms

Keshav Pingali, Mario Méndez-Lojo, Dimitrios Prountzos, Xin Sui, Donald Nguyen, Milind Kulkarni, Martin Burtscher, M. Amber Hassaan, Rashid Kaleem, Tsung-Hsien Lee, Andrew Lenharth, Roman Manevich
2012 SIGPLAN notices  
For more than thirty years, the parallel programming community has used the dependence graph as the main abstraction for reasoning about and exploiting parallelism in "regular" algorithms that use dense  ...  In this paper, we argue that the dependence graph is not a suitable abstraction for algorithms in new application areas like machine learning and network analysis in which the key data structures are "  ...  This class of algorithms may benefit from mechanisms like transactional memory that use more sophisticated conflict detection policies [29] ; in fact, the parallelization of red-black tree operations  ... 
doi:10.1145/2345156.1993501 fatcat:rw74u2dd55cjbitedwwqgeuq2y

Designer-in-the-loop recoding of ESL models using static parallel access conflict analysis

Xu Han, Weiwei Chen, Rainer Dömer
2013 Proceedings of the 16th International Workshop on Software and Compilers for Embedded Systems - M-SCOPES '13  
To efficiently create cleanly structured and parallel models, this paper proposes a designer-in-the-loop approach on Eclipse platform where the system model is analyzed and recoded using automated functions  ...  Experiments using the tool with a class of graduate students show significant productivity gains and error reduction in model creation.  ...  Acknowledgment This work has been supported in part by funding from the National Science Foundation (NSF) under research grant NSF Award #0747523. The authors thank the NSF for the valuable support.  ... 
doi:10.1145/2463596.2463599 dblp:conf/scopes/HanCD13 fatcat:4pn2aezogfhrzho7tkuzgk222q

SaSTL: Spatial Aggregation Signal Temporal Logic for Runtime Monitoring in Smart Cities [article]

Meiyi Ma, Ezio Bartocci, Eli Lifland, John Stankovic, Lu Feng
2021 arXiv   pre-print
We also develop efficient monitoring algorithms that can check a SaSTL requirement in parallel over multiple data streams (e.g., generated by multiple sensors distributed spatially in a city).  ...  We present SaSTL -- a novel Spatial Aggregation Signal Temporal Logic -- for the efficient runtime monitoring of safety and performance requirements in smart cities.  ...  ACKNOWLEDGMENT Supported in part by NSF NRT Grant 1829004.  ... 
arXiv:1908.02366v5 fatcat:mczixgwjfjgjhcturbd2blrvui

Delegated isolation

Roberto Lublinerman, Jisheng Zhao, Zoran Budimlić, Swarat Chaudhuri, Vivek Sarkar
2011 SIGPLAN notices  
In addition to reducing contention in a local, Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made  ...  In this paper, we present Aida, a new model of isolated execution for parallel programs that perform frequent, irregular accesses to pointer-based shared data structures.  ...  scheme used in the Solaris FireEngine network stack.  ... 
doi:10.1145/2076021.2048133 fatcat:lwccfa24tjalpiecpnard3feh4

Delegated isolation

Roberto Lublinerman, Jisheng Zhao, Zoran Budimlić, Swarat Chaudhuri, Vivek Sarkar
2011 Proceedings of the 2011 ACM international conference on Object oriented programming systems languages and applications - OOPSLA '11  
In addition to reducing contention in a local, Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made  ...  In this paper, we present Aida, a new model of isolated execution for parallel programs that perform frequent, irregular accesses to pointer-based shared data structures.  ...  scheme used in the Solaris FireEngine network stack.  ... 
doi:10.1145/2048066.2048133 dblp:conf/oopsla/LublinermanZBCS11 fatcat:rgq4igdd4zblpm4cudf73pbi4q

A vision for GPU-accelerated parallel computation on geo-spatial datasets

Sushil K. Prasad, Michael McDermott, Satish Puri, Dhara Shah, Danial Aghajarian, Shashi Shekhar, Xun Zhou
2015 SIGSPATIAL Special  
Processing Units (GPUs) with 100s to 1000s of processing cores in a single chip forming a key architecture to parallelize over.  ...  We summarize the need and present our vision for accelerating geo-spatial computations and analytics using a combination of shared and distributed memory parallel platforms, with general-purpose Graphics  ...  [20] reports 776 to 11183-fold speedups using CUDA on a GPU for 4096X4096 matrices in comparison with a traditional sequential code on a single CPU core, using a range of improvements and parameter  ... 
doi:10.1145/2766196.2766200 fatcat:ayy3ozgvxvccxirmi3er65no54

Parallel FPGA Routing based on the Operator Formulation

Yehdhih Ould Mohammed Moctar, Philip Brisk
2014 Proceedings of the The 51st Annual Design Automation Conference on Design Automation Conference - DAC '14  
We have implemented an FPGA routing algorithm on a shared memory multi-processor using the Galois API, which offers speculative parallelism in software.  ...  The router is a parallel implementation of PathFinder, which is the basis for most commercial FPGA routers.  ...  . • An implementation of the parallel router in the open source, publicly available Versatile Place and Route (VPR) [9, 10, 15] simulator for FPGA architecture and CAD research. • A favorable experimental  ... 
doi:10.1145/2593069.2593177 dblp:conf/dac/MoctarB14 fatcat:rdf3c2uzxfh7djsbhj7vv3obrq

High performance data clustering: a comparative analysis of performance for GPU, RASC, MPI, and OpenMP implementations

Luobin Yang, Steve C. Chiu, Wei-Keng Liao, Michael A. Thomas
2013 Journal of Supercomputing  
These four implementations include a CUDA implementation for GPUs, a Mitrion C implementation for FPGAs, an MPI implementation for Beowulf compute clusters, and an OpenMP implementation for shared-memory  ...  In this paper, we present four implementations of K-means data clustering algorithm for different high performance computing platforms.  ...  Acknowledgments The authors would like to acknowledge the use of the SGI Altix 4700 located at Idaho National Laboratory for the work performed in this paper, and consultation with Dr.  ... 
doi:10.1007/s11227-013-0906-y pmid:25309040 pmcid:PMC4189017 fatcat:fy4wccng2rhongg52ylgrfpxsa

Structure-driven optimizations for amorphous data-parallel programs

Mario Méndez-Lojo, Donald Nguyen, Dimitrios Prountzos, Xin Sui, M. Amber Hassaan, Milind Kulkarni, Martin Burtscher, Keshav Pingali
2010 Proceedings of the 15th ACM SIGPLAN symposium on Principles and practice of parallel programming - PPoPP '10  
Recent work by the Galois project has provided a systematic approach for parallelizing irregular applications based on the idea of optimistic or speculative execution of programs.  ...  Irregular algorithms are organized around pointer-based data structures such as graphs and trees, and they are ubiquitous in applications.  ...  Event-driven simulation is an example: the sequential algorithm for event-driven simulation processes messages in global time-order. We call these ordered algorithms.  ... 
doi:10.1145/1693453.1693457 dblp:conf/ppopp/Mendez-LojoNPSHKBP10 fatcat:gjbe6arypbgobfqj5uzdfzl5rm

Structure-driven optimizations for amorphous data-parallel programs

Mario Méndez-Lojo, Donald Nguyen, Dimitrios Prountzos, Xin Sui, M. Amber Hassaan, Milind Kulkarni, Martin Burtscher, Keshav Pingali
2010 SIGPLAN notices  
Recent work by the Galois project has provided a systematic approach for parallelizing irregular applications based on the idea of optimistic or speculative execution of programs.  ...  Irregular algorithms are organized around pointer-based data structures such as graphs and trees, and they are ubiquitous in applications.  ...  Event-driven simulation is an example: the sequential algorithm for event-driven simulation processes messages in global time-order. We call these ordered algorithms.  ... 
doi:10.1145/1837853.1693457 fatcat:q22jyik7cfbrtdmcte6nlu4joy

LCM

James R. Larus, Brad Richards, Guhan Viswanathan
1994 Proceedings of the sixth international conference on Architectural support for programming languages and operating systems - ASPLOS-VI  
This paper shows how a flexible, compiler-controlled memory system can help achieve good performance for language constructs that previously appeared too costly to be practical.  ...  Higher-1evel parallel programming languages can be difficult to implement efficiently on parallel machines.  ...  We would like to thank Sarita Adve, Anne Rogers, and Guy Steele for helpful comments on this research and earlier drafts of this paper.  ... 
doi:10.1145/195473.195545 dblp:conf/asplos/LarusRV94 fatcat:z2fkv74ejzb3nkkn6y6oqzkega
« Previous Showing results 1 — 15 out of 1,159 results