Radosław Czarnecki
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Radosław Czarnecki has a total of 3 co-authors. Here are the top co-authors by number of shared publications:
- Stanisław Deniziak
Department of Information Systems, Kielce University of Technology, Kielce, Poland
6 shared publications - Slawomir Bak
Cracow University of Technology, Department of Computer Engineering Warszawska 24, 31-155 Cracow, Poland
3 shared publications K. Sapiecha
Cracow Univ. of Technol., Krakow, Poland
1 shared publication
Latest Publications
- 1 January 2016
- Published by AIP Publishing
- Vol. 1790 (1) , 150022
Scheduling of distributed applications for high performance computing as a service
In this paper we propose the method for scheduling parallel applications in HPCaaS cloud. Applications are specified as distributed algorithms. The goal of our method is to optimize the cost of resource hiring and minimize the execution time of all incoming applications. Experimental results showed that our method gives significantly better utilization of computational resources than classical scheduling methods.
- 1 January 2016
- Published by AIP Publishing
- Vol. 1790 (1) , 150022
Scheduling of distributed applications for high performance computing as a service
In this paper we propose the method for scheduling parallel applications in HPCaaS cloud. Applications are specified as distributed algorithms. The goal of our method is to optimize the cost of resource hiring and minimize the execution time of all incoming applications. Experimental results showed that our method gives significantly better utilization of computational resources than classical scheduling methods.
- Open Access
- 8 April 2015
- Published by MECS Publisher in International Journal of Computer Network and Information Security
- Vol. 7 (5) , 1-8
Embedded Real-Time HTTP Server
This paper presents the architecture of embedded real-time web server. Unlike existing web servers, in our approach, requests are processed not in the-first in first out‖ order but according to their deadlines and the expected server load. For this purpose the Least Laxity First scheduling method is used. First, requests with imposed hard real-time constraints are served. Then requests enclosed by soft deadlines are processed. Finally, request without time requirements are served in the order they arrived. We also present real-time extensions to the Hypertext Transfer Protocol. We propose headers that enable defining hard and soft deadlines, as well as responses containing time information, that are being sent to the client application. The experimental results showed that in case of real-time applications our server misses significantly fewer requests, due to time out, then existing solutions. The presented server may be very useful for implementing real-time services supported by embedded systems, e.g. in future real-time-Internet of things‖ applications.
- 8 April 2015
- Published by MECS Publisher in International Journal of Computer Network and Information Security
- Vol. 7 (5) , 1-8
Open AccessEmbedded Real-Time HTTP Server
This paper presents the architecture of embedded real-time web server. Unlike existing web servers, in our approach, requests are processed not in the-first in first out‖ order but according to their deadlines and the expected server load. For this purpose the Least Laxity First scheduling method is used. First, requests with imposed hard real-time constraints are served. Then requests enclosed by soft deadlines are processed. Finally, request without time requirements are served in the order they arrived. We also present real-time extensions to the Hypertext Transfer Protocol. We propose headers that enable defining hard and soft deadlines, as well as responses containing time information, that are being sent to the client application. The experimental results showed that in case of real-time applications our server misses significantly fewer requests, due to time out, then existing solutions. The presented server may be very useful for implementing real-time services supported by embedded systems, e.g. in future real-time-Internet of things‖ applications.
- 1 January 2013
- Published by Springer Nature in Lecture Notes in Computer Science
- p. 35-49
Synthesis of Real-Time Applications for Internet of Things
- 1 January 2013
- Published by Springer Nature in Lecture Notes in Computer Science
- p. 35-49
Synthesis of Real-Time Applications for Internet of Things
- 1 January 2007
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 1-6
Resource Constrained Co-synthesis of Self-reconfigurable SOPCs
In this work a co-synthesis method, which allows for optimization of dynamically self-reconfigurable SOPC system architecture, is presented. Partially reconfigurable FPGAs let better use hardware resources due to reuse of the same parts of the chip for different functionalities in the same application. The algorithm maximizes speed of the SOPC system taking into consideration FPGA's area constraints. The algorithm starts with the initial solution, where all tasks are assigned to only one general purpose processor module. Next it produces new solutions using iterative improvement methods. The reconfiguration times are taken into consideration in task's scheduling algorithm, in such way, that impact of this time on the system's performance is minimized. Co-synthesis results for dynamically reconfigurable SOPCs have been compared with the results of co-synthesis which didn't take into consideration dynamic reconfiguration. Experimental results showed that applying partially reconfigurable FPGAs significantly increases SOPC performance.
- 1 January 2007
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 1-6
Resource Constrained Co-synthesis of Self-reconfigurable SOPCs
In this work a co-synthesis method, which allows for optimization of dynamically self-reconfigurable SOPC system architecture, is presented. Partially reconfigurable FPGAs let better use hardware resources due to reuse of the same parts of the chip for different functionalities in the same application. The algorithm maximizes speed of the SOPC system taking into consideration FPGA's area constraints. The algorithm starts with the initial solution, where all tasks are assigned to only one general purpose processor module. Next it produces new solutions using iterative improvement methods. The reconfiguration times are taken into consideration in task's scheduling algorithm, in such way, that impact of this time on the system's performance is minimized. Co-synthesis results for dynamically reconfigurable SOPCs have been compared with the results of co-synthesis which didn't take into consideration dynamic reconfiguration. Experimental results showed that applying partially reconfigurable FPGAs significantly increases SOPC performance.
- 1 January 2003
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 443-446
An iterative improvement co-synthesis algorithm for optimization of SOPC architecture with dynamically reconfigurable FPGAs
In this work, a HW/SW iterative improvement co-synthesis algorithm, which allows for optimization of heterogeneous system architecture with dynamically reconfigurable FPGAs is presented. The algorithm maximizes speed of the system taking into consideration cost constraints.
- 1 January 2003
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 443-446
An iterative improvement co-synthesis algorithm for optimization of SOPC architecture with dynamically reconfigurable FPGAs
In this work, a HW/SW iterative improvement co-synthesis algorithm, which allows for optimization of heterogeneous system architecture with dynamically reconfigurable FPGAs is presented. The algorithm maximizes speed of the system taking into consideration cost constraints.