350 rub
Journal Radioengineering №3 for 2014 г.
Article in number:
Modeling of minimization of the interinterface losses in case of multiphase design
Authors:
А.V. Achkasov - Ph.D. (Eng.), Research Institute of Electronic Engineering. E-mail: achkasov@list.ru
O.Ya. Kravez - Dr.Sci. (Eng.), Professor, Voronezh State Technical University. E-mail: xsit@bk.ru
E.S. Podvalniy - Dr.Sci. (Eng.), Professor, The Russian Presidential Academy of National Economy and Public Administration. E-mail: nauka@rags.vrn.ru
Abstract:
The coordinated work of interfaces allows to use a code written for one interface with components of the software of other interface. When a set of interfaces are integrated together in one chain in order that the coordinated work became possible, the way of the analysis is necessary, for definition, how well passed coordination of interfaces in need of use more than one sequence. The modern computer world becomes more and more various. It belongs and to increase of number of services which develop and provide various functions. Also it belongs and to the increased number of developers who independently create new interfaces. To avoid dependence of users on one software producer, it would be ideal if the written code for one interface could be used without changes with other services. Unfortunately, it is impracticable without standardization of interfaces. And slow rate of process of standardization along with fast distribution of services in many respects disturbs standardization process. The interface modules can become the solution of this problem, changing if necessary interfaces. Association them in one sequence provides big flexibility, without causing excessively high costs of development of all demanded interface a component for direct coordination. Unfortunately, the interface module isn't ideal therefore during coordination there can be losses. This problem amplifies when the interface modules are in a chain. Precisely to consider losses in creation of sequences of the interface modules, the mathematical apparatus which allows to analyze such sequences is required. At abstract approach to interpretation abstract domains for a method are looked for, instead of looked for to it similar. In section 2 mathematical formalization by means of which the analysis of losses in sequence of the interface modules is carried out is described. In the 3rd section computing complexity is analyzed, in the 4th section the algorithm is described.
Pages: 116-119
References

  1. Ullman J.D. Elements of ML Programming. Prentice-Hall. 1998. P. 50-51.
  2. Moschovakis Y.N. Notes on Set Theory. Springer-Verlag. 1994. Ch. 4. P. 39.
  3. ChungY., Lee D. Mathematical basis for the chaining of lossy interface adapters // IET Software. 2010. V. 4. № 1. P. 43-54.
  4. ChungY., Lee D. Web of lossy adapters for interface interoperability: An algorithm and NP-completeness of minimization // Proceedings of the 2010 IEEE International Conference on Software Engineering and Service Sciences. Beijing, China. July 2010. P. 95-98.
  5. Arnold K. The Jini Specifications. Addison-Wesley. 2000.
  6. Cousot P. Program analysis: The abstract interpretation perspective // ACM Computing Surveys. 1996. V. 28(4).
  7. Cousot P., Cousot R. Abstract interpretation: A unified lattice model for static analysis of programs by construction or approximation of fixpoints // In Proceedings of the 4th ACM SIGACT-SIGPLAN Symposium on Principles of Programming Languages. ACM Press. January 1977. P. 238-252.
  8. Dams D., Gerth R., Grumberg O. Abstract interpretation of reactive systems // ACM Transactions on Programming Languages and Systems. 1997. V. 19. № 2. P. 253-291.
  9. Dijkstra E.W.A Note on two problems in connexion with graphs // Numerische Mathematik. 1959. V. 1. P. 269-271.
  10. Gschwind T. Typebased adaptation: An adaptation approach for dynamic distributed systems // Proceedings of the 3rd International Workshop on Software Engineering and Middleware. Lecture Notes in Computer Science. May 2002. V. 2596. P. 130-143.
  11. Jones N.D., Nielson F. Abstract interpretation: Asemantics-based tool for program analysis // Handbook of Logic in Computer Science. Oxford University Press. 1995. V. 4. P. 527-636.
  12. Kim B., Lee K., Lee D. An adapter chaining scheme for service continuity in ubiquitous environments with adapter evaluation // Proceedings of the Sixth IEEE International Conference on Pervasive Computing and Communications. IEEE Computer Society Press. March 2008. P. 537-542.
  13. MatenaV, Krishnan S., De Michiel L., Stearns B. Applying Enterprise Java Beans: Component-Based Development for the J2EE Platform. Addison-Wesley. 2003.
  14. Mitchell J.C. Foundations for Programming Languages // Foundations of Computing. MIT Press. 1996. Ch. 5. P. 308-312.
  15. Ponnekanti S.R., Fox A. Application-service interoperation without standardized service interfaces// Proceedings of the 1st IEEE International Conference on Pervasive Computing and Communications. IEEE Computer Society Press. March 2003.
  16. Vayssi`ere J. Transparent dissemination of adapters in Jini // Proceedings of the 3rd International Symposium on Distributed Objects and Applications. September 2001. P. 95-104.
  17. Warner S. Modern Algebra. Dover. 1990. Ch. 1. P. 29-35.
  18. Govorskij A.E'., Tebekin Ju.B. Formalizacziya zadachi minimizaczii poter' pri posledovatel'nom soedinenii programmny'x interfejsov // Informaczionny'e texnologii modelirovaniya i upravleniya. 2011. № 2(67). S. 170-179.
  19. Govorskij A.E'., Tebekin Ju.B., Kravecz O.Ja. Problemy' ob''edineniya interfejsny'x modulej s poteryami pri soglasovanii v czepochki // Sb. trudov «Kriticheskie texnologii vy'chislitel'ny'x i informaczionny'x sistem». Voronezh: MIKT. 2011. S. 120-126.