Filters








35,110 Hits in 2.8 sec

Unit Testing Concurrent Java Programs

Suma Shivaprasad, Nanditha Prasad
2013 International Journal of Computer Applications  
They are not suitable for unit testing multithreaded programs.  ...  Conventional unit-testing practices focus on testing small units of programs sequentially and are very likely to miss concurrent bugs such as race conditions, deadlocks and memory inconsistencies even  ...  The developer doesn't need to specify a specific sequence of interleaving threads to test the system for concurrency conditions.  ... 
doi:10.5120/11435-6798 fatcat:4lte3b3p3nfy5g7633xwhd7zxm

Practical parallel and concurrent programming

Caitlin Sadowski, Thomas Ball, Judith Bishop, Sebastian Burckhardt, Ganesh Gopalakrishnan, Joseph Mayo, Madanlal Musuvathi, Shaz Qadeer, Stephen Toub
2011 Proceedings of the 42nd ACM technical symposium on Computer science education - SIGCSE '11  
These course materials can be used for a comprehensive parallel and concurrent programming course,à la carte throughout an existing curriculum, or as starting points for graduate special topics courses  ...  This paper presents a set of freely available course materials for parallel and concurrent programming, along with a testing tool for performance and correctness concerns called Alpaca (A Lovely Parallelism  ...  ConcJUnit is a framework that ensures that all threads spawned in unit tests terminate, but does not explicitly check for concurrency-specific bugs (such as race conditions).  ... 
doi:10.1145/1953163.1953222 dblp:conf/sigcse/SadowskiBBBGMMQT11 fatcat:rt5w4rw6v5hjtoovlv5ywlo6i4

MTCrossBit: A dynamic binary translation system based on multithreaded optimization

HaiBing Guan, RuHui Ma, HongBo Yang, YinDong Yang, Liang Liu, Ying Chen
2011 Science China Information Sciences  
We propose a multithreaded DBT framework with no associated hardware called the MTCross-Bit, where a helper thread for building a hot trace is employed to significantly reduce the overhead.  ...  However, almost all the existing dynamic optimization techniques or methods employed in DBT systems for a single-threaded executive environment considerably increase the complexity of the hardware or the  ...  B 3 runs for 1000 times. • A hot spot here means a basic block that has run more than 50 times, so that we can only have basic block B 3 for hot trace building. • If there is a compelling optimization  ... 
doi:10.1007/s11432-011-4414-5 fatcat:yaazmmdpfbbcbanlh5wh7hxokm

A concurrent dynamic analysis framework for multicore hardware

Jungwoo Ha, Matthew Arnold, Stephen M. Blackburn, Kathryn S. McKinley
2009 Proceeding of the 24th ACM SIGPLAN conference on Object oriented programming systems languages and applications - OOPSLA 09  
This paper presents the design, implementation, and evaluation of a novel concurrent, configurable dynamic analysis framework that efficiently utilizes multicore cache architectures.  ...  Since Moore's law is now delivering multiple cores instead of faster processors, future systems must either bear a relatively higher cost for abstractions or use some cores to help tolerate abstraction  ...  This section describes a basic cost model for overheads in concurrent and single-threaded dynamic analysis systems.  ... 
doi:10.1145/1640089.1640101 dblp:conf/oopsla/HaABM09 fatcat:lzkkrc3w4ne4bjznhiwaie36jm

A concurrent dynamic analysis framework for multicore hardware

Jungwoo Ha, Matthew Arnold, Stephen M. Blackburn, Kathryn S. McKinley
2009 SIGPLAN notices  
This paper presents the design, implementation, and evaluation of a novel concurrent, configurable dynamic analysis framework that efficiently utilizes multicore cache architectures.  ...  Since Moore's law is now delivering multiple cores instead of faster processors, future systems must either bear a relatively higher cost for abstractions or use some cores to help tolerate abstraction  ...  This section describes a basic cost model for overheads in concurrent and single-threaded dynamic analysis systems.  ... 
doi:10.1145/1639949.1640101 fatcat:i7dgkfveqnex3ms5bvefsqn3u4

Adaptive Scheduling Applied to Non-Deterministic Networks of Heterogeneous Tasks for Peak Throughput in Concurrent Gaudi

Illya Shapoval, Marco Clemencic, Luca Tomassetti
2016 Zenodo  
Firstly, I present the reactive graph-based concurrency control system for low latency and scalable task precedence resolution in unpredictable data processing conditions.  ...  I prove a significant potential of this merger for throughput maximization in general and for the adoption of the paradigm of heterogeneous computing in the context of GAUDI in particular.  ...  This constitutes a soft real-time requirement [13] for the system, since the usefulness of decisions on concurrency control degrades with time.  ... 
doi:10.5281/zenodo.3866313 fatcat:gfbiekvdebbbfib5sdmlrjku6y

Partial-evaluation techniques for concurrent programs

Mihnea Marinescu, Benjamin Goldberg
1997 SIGPLAN notices  
A standard binding-time analysis for imperative languages is extended in order to deal with the basic concurrent constructs (synchronous communication and nondeterministic choice).  ...  This paper presents an application of partial evali uation (program specialization techniques to concurrent progmms. The language c osen for this investigation is a very simple CSP-like language.  ...  Acknowledgements: We are grateful to Olivier Danvy and the anonymous reviewers for their comments.  ... 
doi:10.1145/258994.259002 fatcat:ylefkvztybc6phtvrr5us6vpbi

Partial-evaluation techniques for concurrent programs

Mihnea Marinescu, Benjamin Goldberg
1997 Proceedings of the 1997 ACM SIGPLAN symposium on Partial evaluation and semantics-based program manipulation - PEPM '97  
A standard binding-time analysis for imperative languages is extended in order to deal with the basic concurrent constructs (synchronous communication and nondeterministic choice).  ...  This paper presents an application of partial evali uation (program specialization techniques to concurrent progmms. The language c osen for this investigation is a very simple CSP-like language.  ...  Acknowledgements: We are grateful to Olivier Danvy and the anonymous reviewers for their comments.  ... 
doi:10.1145/258993.259002 dblp:conf/pepm/MarinescuG97 fatcat:y7p3zexlcffyzjrmlfuz76bgg4

JTED: parallel discrete-event simulation in Java

James Cowie
1998 Concurrency Practice and Experience  
The framework also provides standard hooks for integrating graphical tools with a running simulation.  ...  JTED attempts to replicate in Java the advances in high-level modeling achieved by the TeD system from Georgia Tech 2 , 3 , which used a custom little language compiled to C++ and the Georgia Time Warp  ...  Each s c heduler runs in one concurrent J a v a thread, which maps to one system native thread, thus hiding the mechanics of mapping logical concurrency to physical processors from the modeler.  ... 
doi:10.1002/(sici)1096-9128(199809/11)10:11/13<993::aid-cpe405>3.0.co;2-c fatcat:chpqpft4pvebjiezniu4rfgjcm

JTED: parallel discrete-event simulation in Java

James Cowie
1998 Concurrency Practice and Experience  
The framework also provides standard hooks for integrating graphical tools with a running simulation.  ...  JTED attempts to replicate in Java the advances in high-level modeling achieved by the TeD system from Georgia Tech 2 , 3 , which used a custom little language compiled to C++ and the Georgia Time Warp  ...  Each s c heduler runs in one concurrent J a v a thread, which maps to one system native thread, thus hiding the mechanics of mapping logical concurrency to physical processors from the modeler.  ... 
doi:10.1002/(sici)1096-9128(199809/11)10:11/13<993::aid-cpe405>3.3.co;2-3 fatcat:6c5yl25ojbar7dezov2rknu4j4

RTFM-RT: A threaded runtime for RTFM-core - towards execution of IEC 61499

Andreas Lindner, Marcus Lindner, Per Lindgren
2015 2015 IEEE 20th Conference on Emerging Technologies & Factory Automation (ETFA)  
The IEC 61449 standard provides an outset for designing and deploying distributed control systems. Recently, a mapping from IEC 61499 to the RTFM-kernel API has been presented.  ...  In this paper, we detail the generic RTFM-RT runtime architecture, which allows RTFMcore programs to be executed on top of thread based environments.  ...  A major focus lies on providing a model for concurrent real-time programming, suitable for static analysis and run time verification.  ... 
doi:10.1109/etfa.2015.7301501 dblp:conf/etfa/LindnerLL15 fatcat:52kdrlcicvbklimhmuxcyj4dwm

Cooperative crug isolation

Aditya Thakur, Rathijit Sen, Ben Liblit, Shan Lu
2009 Proceedings of the Seventh International Workshop on Dynamic Analysis - WODA '09  
CCI correctly diagnoses bugs in several nontrivial concurrent applications while incurring only 2-7% run-time overhead.  ...  CCI inserts instrumentation that records occurrences of specific thread interleavings at run-time by tracking whether successive accesses to a memory location were by the same thread or by distinct threads  ...  Record-and-replay systems for multi-core machines could also aid in debugging concurrent programs.  ... 
doi:10.1145/2134243.2134252 dblp:conf/issta/ThakurSLL09 fatcat:r22jccgofjc4vbnvxy4adaw6zq

Staged event-driven architecture as a micro-architecture of distributed and pluginable crawling platform

Siwik Leszek, Wlodarczyk Kamil, Kluczny Mateusz
2013 Computer Science  
There is a meaningful group of users, however, which require an all-in-one studio, not only for executing and running Internet robots, but also for (graphical) (re)defining and (re)composing crawlers according  ...  Crawling systems available on the market are usually closed solutions dedicated to performing a particular kind of task.  ...  Concurrency models In the context of any concurrent systems (and crawling systems in particular), the crucial element is the model of concurrency applied.  ... 
doi:10.7494/csci.2013.14.4.645 fatcat:4i64msdthnar5ci2wg7ft5j3fe

Concurrent object-oriented programming

Gul Agha
1990 Communications of the ACM  
of the Silicon Valley Patterns Group performed similar valuable service for preliminary versions of the second edition.  ...  Particular run-time systems may provide the stronger guarantees required in some safety-critical hard-real-time systems.  ...  For example, dynamic compilation allows many extensible components to be treated as if they are closed at classloading time, leading to optimizations and specializations that exploit particular run-time  ... 
doi:10.1145/83880.84528 fatcat:natymhbbtbh7zivohgmsjbwg3m

Progress guarantee for parallel programs via bounded lock-freedom

Erez Petrank, Madanlal Musuvathi, Bjarne Steesngaard
2009 Proceedings of the 2009 ACM SIGPLAN conference on Programming language design and implementation - PLDI '09  
We use this formal definition to build a tool that checks if a concurrent program is bounded lock-free for a given bound.  ...  A composition theorem asserts that bounded lock-free algorithms running on bounded lock-free supporting systems retain bounded lock-freedom for the composed execution.  ...  Acknowledgement We thank Roy Friedman, Tim Harris, Maurice Herlihy, Victor Luchangco, Maged Michael, Mark Moir, Nir Shavit, and David Tarditi for many helpful discussions.  ... 
doi:10.1145/1542476.1542493 dblp:conf/pldi/PetrankMS09 fatcat:nffg4nxd3rdffbv3koscf5gaae
« Previous Showing results 1 — 15 out of 35,110 results