scholarly journals Timely Fine-Grained Interference-Sensitive Run-Time Adaptation of Time-Triggered Schedules

Author(s):  
Stefanos Skalistis ◽  
Angeliki Kritikakou
Keyword(s):  
Author(s):  
Arunkumar Vijayan ◽  
Abhishek Koneru ◽  
Saman Kiamehr ◽  
Krishnendu Chakrabarty ◽  
Mehdi B. Tahoori

2018 ◽  
Vol 40 ◽  
pp. 31-43 ◽  
Author(s):  
Panagiotis Andriotis ◽  
Gianluca Stringhini ◽  
Martina Angela Sasse

Author(s):  
STEPHEN H. EDWARDS ◽  
WESTLEY HAGGARD

In component-based systems, there are several obstacles to using Design by Contract (DbC), particularly with respect to third-party components. Contracts are particularly valuable when debugging or testing composite software structures that include third-party components. However, existing approaches have critical weaknesses. First, existing approaches typically require a component's source code to be available if you wish to strip (or re-insert) checks. Second, documentation of the contract is either distributed separately from the component or embedded in the component's source code. Third, enabling and disabling specific kinds of checks on separate components from independent vendors can be a significant challenge. This paper describes an approach to representing contracts for .NET components using attributes. This contract information can be retrieved from the compiled component's metadata and used for many purposes. The paper also describes nContract, a tool that automatically generates run-time checks from embedded contracts. Such run-time checks can be generated and added to a system without requiring source code access or recompilation. Further, when checks for a given component are excluded, they impose no run-time overhead. Finally, a highly expressive, fine-grained mechanism for controlling user preferences about which specific checks are enabled or disabled is presented.


Author(s):  
Hiroki Matsutani ◽  
Michihiro Koibuchi ◽  
Daisuke Ikebuchi ◽  
Kimiyoshi Usami ◽  
Hiroshi Nakamura ◽  
...  
Keyword(s):  
Run Time ◽  

2012 ◽  
Vol 2012 ◽  
pp. 1-9 ◽  
Author(s):  
Rafael A. Arce-Nazario ◽  
José Ortiz-Ubarri

The enumeration of two-dimensional Costas arrays is a problem with factorial time complexity and has been solved for sizes up to 29 using computer clusters. Costas arrays of higher dimensionality have recently been proposed and their properties are beginning to be understood. This paper presents, to the best of our knowledge, the first proposed implementations for enumerating these multidimensional arrays in GPUs and FPGAs, as well as the first discussion of techniques to prune the search space and reduce enumeration run time. Both GPU and FPGA implementations rely on Costas array symmetries to reduce the search space and perform concurrent explorations over the remaining candidate solutions. The fine grained parallelism utilized to evaluate and progress the exploration, coupled with the additional concurrency provided by the multiple instanced cores, allowed the FPGA (XC5VLX330-2) implementation to achieve speedups of up to 30× over the GPU (GeForce GTX 580).


Sign in / Sign up

Export Citation Format

Share Document