Operating Systems for Reconfigurable Computing: Concepts and Survey

Author(s):  
Cornelia Wulf ◽  
Michael Willig ◽  
Gökhan Akgün ◽  
Diana Göhringer
IEEE Micro ◽  
2014 ◽  
Vol 34 (1) ◽  
pp. 54-58 ◽  
Author(s):  
David Andrews

2016 ◽  
Vol 2016 ◽  
pp. 1-11 ◽  
Author(s):  
Marcel Eckert ◽  
Dominik Meyer ◽  
Jan Haase ◽  
Bernd Klauer

One of the key future challenges for reconfigurable computing is to enable higher design productivity and a more easy way to use reconfigurable computing systems for users that are unfamiliar with the underlying concepts. One way of doing this is to provide standardization and abstraction, usually supported and enforced by an operating system. This article gives historical review and a summary on ideas and key concepts to include reconfigurable computing aspects in operating systems. The article also presents an overview on published and available operating systems targeting the area of reconfigurable computing. The purpose of this article is to identify and summarize common patterns among those systems that can be seen as de facto standard. Furthermore, open problems, not covered by these already available systems, are identified.


2017 ◽  
Author(s):  
Rebin B. Khoshnaw ◽  
Dana F. Doghramach ◽  
Mazin S. Al-Hakeem

Author(s):  
Georgiy Aleksandrovich Popov

The article deals with a two-channel queuing system with a Poisson incoming call flow, in which the application processing time on each of the devices is different. Such models are used, in particular, when describing the operation of the system for selecting service requests in a number of operating systems. A complex system characteristic was introduced at the time of service endings on at least one of the devices, including the queue length, the remaining service time on the occupied device, and the time since the beginning of the current period of employment. This characteristic determines the state of the system at any time. Recurrence relations are obtained that connect this characteristic with its marginal values when there is no queue in the system. The method of introducing additional events was chosen as one of the main methods for analyzing the model. The relationships presented in this article can be used for analysis of the average characteristics of this system, as well as in the process of its simulation. Summarizing the results of work on multichannel systems with an arbitrary number of servicing devices will significantly reduce the time required for simulating complex systems described by sets of multichannel queuing systems.


2020 ◽  
Author(s):  
Jeffrey Mendenhall ◽  
Benjamin Brown ◽  
Sandeepkumar Kothiwale ◽  
Jens Meiler

<div>This paper describes recent improvements made to the BCL::Conf rotamer generation algorithm and comparison of its performance against other freely available and commercial conformer generation software. We demonstrate that BCL::Conf, with the use of rotamers derived from the COD, more effectively recovers crystallographic ligand-binding conformations seen in the PDB than other commercial and freely available software. BCL::Conf is now distributed with the COD-derived rotamer library, free for academic use. The BCL can be downloaded at <a href="http://meilerlab.org/index.php/bclcommons/show/b_apps_id/1">http://meilerlab.org/ bclcommons</a> for Windows, Linux, or Apple operating systems.<br></div>


2011 ◽  
Vol 1 (2) ◽  
pp. 1-4
Author(s):  
S. Murugan ◽  
K. Kuppusamy
Keyword(s):  

Sign in / Sign up

Export Citation Format

Share Document