• Refine Query
  • Source
  • Publication year
  • to
  • Language
  • 1
  • Tagged with
  • 1
  • 1
  • 1
  • 1
  • 1
  • 1
  • 1
  • 1
  • 1
  • 1
  • 1
  • 1
  • 1
  • 1
  • 1
  • About
  • The Global ETD Search service is a free service for researchers to find electronic theses and dissertations. This service is provided by the Networked Digital Library of Theses and Dissertations.
    Our metadata is collected from universities around the world. If you manage a university/consortium/country archive and want to be added, details can be found on the NDLTD website.
1

Uma m?quina de redu??o de grafos extens?vel para a implementa??o de fluxos de trabalho / An extensible graph reduction machine for workflow implementation

Mac?do, M?rcio Alves de 26 February 2015 (has links)
Submitted by Automa??o e Estat?stica (sst@bczm.ufrn.br) on 2016-02-22T21:43:01Z No. of bitstreams: 1 MarcioAlvesDeMacedo_DISSERT.pdf: 2923226 bytes, checksum: e6a66719b01ddee0f70ac0a7f964923e (MD5) / Approved for entry into archive by Arlan Eloi Leite Silva (eloihistoriador@yahoo.com.br) on 2016-02-23T23:10:23Z (GMT) No. of bitstreams: 1 MarcioAlvesDeMacedo_DISSERT.pdf: 2923226 bytes, checksum: e6a66719b01ddee0f70ac0a7f964923e (MD5) / Made available in DSpace on 2016-02-23T23:10:23Z (GMT). No. of bitstreams: 1 MarcioAlvesDeMacedo_DISSERT.pdf: 2923226 bytes, checksum: e6a66719b01ddee0f70ac0a7f964923e (MD5) Previous issue date: 2015-02-26 / M?quinas de redu??o de grafos, s?o tradicionalmente utilizadas na implementa??o de linguagens de programa??o. Elas permitem executar programas (representados como grafos), atrav?s da aplica??o sucessiva de regras de redu??o. A composi??o de servi?os web permite a cria??o de novos servi?os web a partir de servi?os web j? existentes. BPEL ? a linguagem padr?o para criar composi??es de servi?os web como fluxos de trabalho. No entanto, o uso de BPEL para definir composi??es que usem outras tecnologias, al?m dos servi?os web n?o ? imediato. Na maioria dos casos, quando opera??es que n?o fazem parte do dom?nio dos servi?os web precisam ser executadas nas regras de neg?cio de uma empresa, parte do trabalho ? realizado de forma ad-hoc. Permitir que opera??es oriundas de diferentes tecnologias possam fazer parte de um mesmo fluxo de trabalho auxilia a cria??o de fluxos de trabalho mais adequados ?s necessidades das organiza??es. Esta disserta??o define uma variante da linguagem BPEL para a cria??o de composi??es com opera??es de servi?os web, tarefas de big data ou opera??es definidas pelo usu?rio. O suporte a esta linguagem ? dado mediante a defini??o de uma m?quina de redu??o de grafos extens?vel, a qual permite a execu??o de programas definidos na linguagem proposta. Esta m?quina ? implementada como prova de conceito. A proposta deste trabalho ? avaliada mediante a apresenta??o de resultados experimentais. / Graph Reduction Machines, are a traditional technique for implementing functional programming languages. They allow to run programs by transforming graphs by the successive application of reduction rules. Web service composition enables the creation of new web services from existing ones. BPEL is a workflow-based language for creating web service compositions. It is also the industrial and academic standard for this kind of languages. As it is designed to compose web services, the use of BPEL in a scenario where multiple technologies need to be used is problematic: when operations other than web services need to be performed to implement the business logic of a company, part of the work is done on an ad hoc basis. To allow heterogeneous operations to be part of the same workflow, may help to improve the implementation of business processes in a principled way. This work uses a simple variation of the BPEL language for creating compositions containing not only web service operations but also big data tasks or user-defined operations. We define an extensible graph reduction machine that allows the evaluation of BPEL programs and implement this machine as proof of concept. We present some experimental results.

Page generated in 0.1317 seconds