Concurrency Control in the Problem of Automatic Substitution of the Dataflow Network Agent on Smart-M3 Platform and in the Internet of Things
https://doi.org/10.18255/1818-1015-2012-5-131-141
Abstract
The paper describes implementation of dataflow networks based on Smart-M3 platform for use cases related to the Internet of Things. The mechanism for automatic substitution of computational agents created on top of Smart-M3 platform is described. The paper reviews concurrency issues of the developed solution regarding Smart-M3 platform, as well as in the broader context of the Internet of Things.
About the Authors
S. I. Balandin
Технологический университет;
Ассоциация открытых инноваций FRUCT
Russian Federation
Russian Federation
г. Тампере (Финляндия), канд. техн. наук, адъюнкт-профессор;
президент
A. M. Vasilev
Ярославский государственный университет им. П.Г. Демидова
Russian Federation
аспирант каф. теоретической информатики
Russian Federation
аспирант каф. теоретической информатики
N. I. Kozhemyakin
Ярославский государственный университет им. П.Г. Демидова
Russian Federation
студент факультета ИВТ
Russian Federation
студент факультета ИВТ
D. A. Laure
Ярославский государственный университет им. П.Г. Демидова
Russian Federation
студент факультета ИВТ
Russian Federation
студент факультета ИВТ
I. V. Paramonov
Ярославский государственный университет им. П.Г. Демидова
Russian Federation
канд. физ.-мат. наук, старший преподаватель каф. компьютерных сетей.
Russian Federation
канд. физ.-мат. наук, старший преподаватель каф. компьютерных сетей.
References
1. Atzori L., Iera A., Morabito G. The internet of things: A survey // Computer Networks. — 2010. — Vol. 54, no. 15. — P. 2787–2805.
2. Internet of Things Strategic Research Roadmap / O. Vermesan, P. Friess, P. Guillemin et al. // Internet of Things — Global Technological and Societal Trends. — 2011. — P. 9–52.
3. User Scenarios 2020 — a Worldwide Wireless Future / L. Sørensen, K. E. Skouby, D. Dietterle et al. // WWRF Outlook: Visions and Research Directions for the Wireless World. — 2009. — July. — no. 4.
4. The Internet of Things Initiative. — URL: http://www.iot-i.eu/public/front-page.
5. TiViT Internet of Things. — URL: http://www.internetofthings.fi.
6. Internet-of-Things Architecture. Deliverable D1.3 — Updated reference model for IoT v1.5. — URL: http://www.iot-a.eu/public/public-documents/documents-1/1/1/copy_of_d1.2/at_download/file.
7. Kok J. A fully abstract semantics for data flow nets // PARLE Parallel Architectures and Languages Europe / Springer. — 1987. — P. 351–368.
8. Smart-M3 information sharing platform / J. Honkola, H. Laine, R. Brown, O. Tyrkk¨o // 2010 IEEE Symposium on Computers and Communications (ISCC) / IEEE. — 2010. — P. 1041–1046.
9. Luukkala V., Honkola J. Integration of an answer set engine to Smart-M3 // Smart Spaces and Next Generation Wired/Wireless Networking. — 2010. — P. 92–101.
10. Case study: Context-aware supervision of a smart maintenance process / S. PantsarSyvaniemi, E. Ovaska, S. Ferrari et al. // Proceedings of the 11th IEEE/IPSJ International Symposium on Applications and the Internet (SAINT 2011) / IEEE. — 2011. — P. 309–314.
11. Solaiman K., Morgan G. Later validation/earlier write: Concurrency control for resource-constrained systems with real-time properties // Proceedings of 2011 30th IEEE Symposium on Reliable Distributed Systems Workshops (SRDSW) / IEEE. — 2011. — October. — P. 9–12.
12. H¨arder T. Observations on optimistic concurrency control schemes // Information Systems. — 1984. — Vol. 9, no. 2. — P. 111–120.
13. Concurrency control in mobile environments: Issues & chalenges / S. A. Moiz, S. N. Pal, J. Kumar et al. // International Journal of Database Management Systems (IJDMS). — 2011. — November. — Vol. 3, no. 4. — P. 147–159.
Review
For citations:
Balandin S.I., Vasilev A.M., Kozhemyakin N.I., Laure D.A., Paramonov I.V. Concurrency Control in the Problem of Automatic Substitution of the Dataflow Network Agent on Smart-M3 Platform and in the Internet of Things. Modeling and Analysis of Information Systems. 2012;19(5):131-141. (In Russ.) https://doi.org/10.18255/1818-1015-2012-5-131-141
Views:
861
Email this article 