Show simple item record

Vivacidad y justicia en entornos no deterministas

dc.contributor.authorRuiz Cortés, Davidspa
dc.contributor.authorCorchuelo, Rafaelspa
dc.contributor.authorRuiz Cortés, Antoniospa
dc.date.accessioned2020-10-27T00:21:30Z
dc.date.available2020-10-27T00:21:30Z
dc.date.issued2002-06-01
dc.identifier.issn2539-2115
dc.identifier.issn1657-2831
dc.identifier.urihttp://hdl.handle.net/20.500.12749/9064
dc.description.abstractEl problema de la vivacidad y la selección justa surge en el contexto de los sistemas con ejecuciones no deterministas. El concepto de selección completamente justa ´ sirve para garantizar que todos los elementos que se habilitan infinitamente a menudo se ejecutan infinitamente a menudo. Esta noción de selección presenta dos anomalías: la finitud justa y las conspiraciones. Este articulo se centra en la selección justa de interacciones en sistemas basados en ´ interacciones entre múltiples participantes ´ y presenta una nueva noción llamada ´ selección completamente ´ k–justa cuya principal ventaja sobre otras propuestas es que da solución a las dos anomalías de forma simultanea. Para ello, hemos descrito un marco de trabajo teórico para caracterizar los sistemas ´ basados en interacciones entre múltiples participantes que hace independiente el criterio de selección del lenguaje de programación . También presentamos un algoritmo general para implementar ´ la selección completamente ´ k–justa de interacciones que no requiere acceder al estado local de los procesos del sistema.spa
dc.format.mimetypeapplication/pdfspa
dc.language.isospaspa
dc.publisherUniversidad Autónoma de Bucaramanga UNAB
dc.relationhttps://revistas.unab.edu.co/index.php/rcc/article/view/1109/1081
dc.relation.urihttps://revistas.unab.edu.co/index.php/rcc/article/view/1109
dc.rightsDerechos de autor 2002 Revista Colombiana de Computación
dc.rights.urihttp://creativecommons.org/licenses/by-nc-sa/4.0/*
dc.rights.urihttp://creativecommons.org/licenses/by-nc-nd/2.5/co/
dc.sourceRevista Colombiana de Computación; Vol. 3 Núm. 1 (2002): Revista Colombiana de Computación; 73-92
dc.subjectInnovaciones tecnológicas
dc.subjectCiencia de los computadores
dc.subjectDesarrollo de tecnología
dc.subjectIngeniería de sistemas
dc.subjectInvestigaciones
dc.subjectTecnologías de la información y las comunicaciones
dc.subjectTIC´s
dc.titleVivacidad y justicia en entornos no deterministasspa
dc.title.translatedLiveliness and fairness in non-deterministic environmentseng
dc.type.driverinfo:eu-repo/semantics/article
dc.type.localArtículospa
dc.type.coarhttp://purl.org/coar/resource_type/c_7a1f
dc.subject.keywordsTechnological innovationseng
dc.subject.keywordsComputer scienceeng
dc.subject.keywordsTechnology developmenteng
dc.subject.keywordsSystems engineeringeng
dc.subject.keywordsInvestigationseng
dc.subject.keywordsInformation and communication technologieseng
dc.subject.keywordsICT'seng
dc.subject.keywordsDistributed systemseng
dc.subject.keywordsInteractions between multiple participantseng
dc.subject.keywordsVivacityeng
dc.subject.keywordsfair selection
dc.identifier.instnameinstname:Universidad Autónoma de Bucaramanga UNABspa
dc.type.hasversioninfo:eu-repo/semantics/acceptedVersion
dc.rights.accessrightsinfo:eu-repo/semantics/openAccessspa
dc.relation.referencesR. Alur and T. A. Henzinger. Finitary fairness. ACM Transactions on Programming Languages and Systems, 20(6):1171–1194, November 1998.
dc.relation.referencesP.C. Attie, N. Francez, and O. Grumberg. Fairness and hyperfairness in multiparty interactions. Distributed Computing, 6(4):245–254, 1993.
dc.relation.referencesR.L. Bagrodia. Process synchronization: Design and performance evaluation of distributed algorithms. IEEE Transactions on Software Engineering, 15(9):1053–1065, September 1989.
dc.relation.referencesE. Best. Fairness and conspiracies. Information Processing Letters, 18(4):215–220, 1984.
dc.relation.referencesE. Best. Semantics of Sequential and Parallel Programs. Prentice Hall, New York, 1996.
dc.relation.referencesJ.R. Buchi. On a decision method in restricted second order arithmetic. In ¨ Proceedings of the International Congress on Logic, Method, and Philosophy of Science, pages 1–12, Stanford, CA, USA, 1962. Stanford University Press.
dc.relation.referencesK.M. Chandy and J. Misra. Parallel Program Design: A Foundation. Addison–Wesley, 1988.
dc.relation.referencesR. Corchuelo, J.A. Perez, and M. Toro. A multiparty coordination aspect language. ´ ACM Sigplan, 35(12):24–32, December 2000.
dc.relation.referencesR. Corchuelo, D. Ruiz, M. Toro, and A. Ruiz. Implementing multiparty interactions on a network computer. In Proceedings of the XXVth Euromicro Conference (Workshop on Network Computing), Milan, September 1999. IEEE Press.
dc.relation.referencesM. Evangelist, V.Y. Shen, I.R. Forman, and M. Graf. Using Raddle to design distributed systems. In Proceedings of the 10th International Conference on Software Engineering, pages 102–115. IEEE Computer Society Press, April 1988.
dc.relation.referencesN. Francez. Fairness. Springer–Verlag, 1986.
dc.relation.referencesN. Francez and I. Forman. Interacting processes: A multiparty approach to coordinated distributed programming. Addison–Wesley, 1996.
dc.relation.referencesN. Francez and M. Rodeh. A distributed abstract data type implemented by a probabilistic communication scheme. In Proc. 21st Ann. IEEE Symp. on Foundations of Computer Science, pages 373–379, 1980.
dc.relation.referencesY.J. Joung. Two decentralized algorithms for strong interaction fairness for systems with unbounded speed variability. Theoretical Computer Science, 243(1–2):307–338, 2000.
dc.relation.referencesY.J. Joung and S.A. Smolka. Strong interaction fairness via randomization. IEEE Transactions on Parallel and Distributed Systems, 9(2):137–149, February 1998.
dc.relation.referencesE. Olderog and K.R. Apt. Fairness in parallel programs: The transformational approach. ACM Transactions on Programming Languages and Systems, 10(3):420–455, July 1988.
dc.relation.referencesJ. A. Perez, R. Corchuelo, D. Ruiz, and M. Toro. An order-based, distributed algorithm for im- ´ plementing multiparty interactions. In Fifth International Conference on Coordination Models and Languages COORDINATION 2002, pages 250–257, York, UK, 2002. Springer–Verlag.
dc.relation.referencesJ.A. Perez, R. Corchuelo, D. Ruiz, and M. Toro. A framework for aspect–oriented multiparty ´ coordination. In New Developments in Ditributed Applications and Interoperable Systems, pages 161–173. Kluwer Academic Publishers, 2001.
dc.relation.referencesJ.A. Perez, R. Corchuelo, D. Ruiz, and M. Toro. An enablement detection algorithm for open ´ multiparty interactions. In ACM Symposium on Applied Computing SAC’02, pages 378–384, Madrid, Spain, 2002. Springer–Verlag.
dc.relation.referencesD. Ruiz, R. Corchuelo, J.A. Perez, and M. Toro. Un algoritmo descentralizado de selecci ´ on´ justa de interacciones entre multiples participantes. In ´ Simposio Espanol de Inform ˜ atica Dis- ´ tribuida 2000, pages 419–427, Ourense, Spain, 2000.
dc.relation.referencesA.S. Tanenbaum. Modern Operating Systems. Prentice Hall, New Jersey, 1992.
dc.relation.referencesY.K. Tsay and R.L. Bagrodia. Some impossibility results in interprocess synchronization. Distributed Computing, 6(4):221–231, 1993.
dc.contributor.googlescholarCorchuelo, Rafael [xH6ErLQAAAAJ]spa
dc.contributor.googlescholarRuiz Cortés, Antonio [Ka-FHBQAAAAJ]spa
dc.contributor.orcidCorchuelo, Rafael [0000-0003-1563-6979]spa
dc.contributor.orcidRuiz Cortés, Antonio [0000-0001-9827-1834]spa
dc.contributor.researchgateRuiz Cortés, Antonio [Antonio-Ruiz-Cortes]spa
dc.subject.lembInnovaciones tecnológicasspa
dc.subject.lembCiencias de la computaciónspa
dc.subject.lembDesarrollo tecnológicospa
dc.subject.lembIngeniería de sistemasspa
dc.subject.lembInvestigacionesspa
dc.subject.lembTecnologías de la información y la comunicaciónspa
dc.identifier.repourlrepourl:https://repository.unab.edu.co
dc.description.abstractenglishThe problem of liveliness and fair selection arises in the context of systems with executing non-deterministic tions. The concept of completely fair selection serves to ensure that all items that are enabled infinitely often are executed infinitely often. This notion of selection presents two anomalies: fair finitude and conspiracies. East The article focuses on the fair selection of interactions in systems based on multi-participant interactions and introduces a new notion called completely k-fair selection. whose main advantage over other proposals is that it solves the two anomalies simultaneously. To do this, we have described a theoretical framework to characterize the systems based on interactions between multiple participants that makes the selection criteria independent tion of the programming language. We also present a general algorithm to implement the completely k-fair selection of interactions that does not require access to the local state of system processes.eng
dc.subject.proposalSistemas distribuidosspa
dc.subject.proposalInteracciones entre múltiples participantesspa
dc.subject.proposalVivacidadspa
dc.subject.proposalSelección justaspa
dc.type.redcolhttp://purl.org/redcol/resource_type/CJournalArticle
dc.rights.creativecommonsAtribución-NoComercial-SinDerivadas 2.5 Colombia*


Files in this item

Thumbnail
Name:
2002_Articulo_Vivacidad y justicia ...
Size:
664.6Kb
Format:
PDF
Description:
Artículo
View/Open

This item appears in the following Collection(s)

Show simple item record

Atribución-NoComercial-SinDerivadas 2.5 Colombia
Except where otherwise noted, this item's license is described as Atribución-NoComercial-SinDerivadas 2.5 Colombia