Synthesis of Real-Time Applications for Internet of Things

Bak, Slawomir; Czarnecki, Radosław; Deniziak, Stanislaw

doi:10.1007/978-3-642-37015-1_4

Cited by 2 publications

(2 citation statements)

References 8 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…They propose an EDF-greedy scheme that considers temporal overlapping to allocate resources efficiently. The methods of cost-aware synthesis of real-time cloud applications for IoT are presented in [15] [16] [17].…”

Section: Related Workmentioning

confidence: 99%

Embedded Real-Time HTTP Server

Czarnecki¹,

Deniziak²

2015

IJCNIS

Self Cite

View full text Add to dashboard Cite

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.

show abstract

Section: Related Workmentioning

confidence: 99%

Embedded Real-Time HTTP Server

Czarnecki¹,

Deniziak²

2015

IJCNIS

Self Cite

View full text Add to dashboard Cite

show abstract

“…In our earlier works [19], [20] synthesis is performed using the greedy algorithm, that schedules processes according to their priority. However, it is constructive algorithm and the obtained results are far from optimal, because the method is prone to be trapped in the local minima of the cost.…”

Section: Algorithm Of the Synthesismentioning

confidence: 99%

Synthesis of Real Time Distributed Applications for Cloud Computing

Deniziak

Bak

2014

Annals of Computer Science and Information Systems

Self Cite

View full text Add to dashboard Cite

Abstract-This paper presents the methodology for the synthesis of real-time applications for the Infrastructure as a Service (IaaS) model of cloud computing. We assume that the function of the application is specified as a set of distributed echo algorithms with real-time constraints. Then our methodology schedules all tasks on available cloud infrastructure minimizing the total costs of the IaaS services, while satisfying all real-time requirements. It takes into account limited bandwidth of communication channels as well as the limited computation power of server nodes. The optimization is based on the iterative improvement algorithm, which has the capability of escaping from the local extrema, giving better results than greedy algorithms. The method starts from the fastest solution and in the next steps modifies the solution to reduce the cost of hiring the cloud infrastructure. We also present a sample application, that shows the benefits of using our methodology.

show abstract

Synthesis of Real-Time Applications for Internet of Things

Cited by 2 publications

References 8 publications

Embedded Real-Time HTTP Server

Embedded Real-Time HTTP Server

Synthesis of Real Time Distributed Applications for Cloud Computing

Contact Info

Product

Resources

About