Over the last few years, Cloud storage systems and so-called NoSQL datastores have found widespread adoption. In contrast to traditional databases, these storage systems typically sacrifice consistency in favor of latency and availability as mandated by the CAP theorem, so that they only guarantee eventual consistency. Existing approaches to benchmark these storage systems typically omit the consistency dimension or did not investigate eventuality of consistency guarantees. In this work we present a novel approach to benchmark staleness in distributed datastores and use the approach to evaluate Amazon's Simple Storage Service (S3). We report on our unexpected findings.
{"title":"Eventual consistency: How soon is eventual? An evaluation of Amazon S3's consistency behavior","authors":"David Bermbach, S. Tai","doi":"10.1145/2093185.2093186","DOIUrl":"https://doi.org/10.1145/2093185.2093186","url":null,"abstract":"Over the last few years, Cloud storage systems and so-called NoSQL datastores have found widespread adoption. In contrast to traditional databases, these storage systems typically sacrifice consistency in favor of latency and availability as mandated by the CAP theorem, so that they only guarantee eventual consistency. Existing approaches to benchmark these storage systems typically omit the consistency dimension or did not investigate eventuality of consistency guarantees. In this work we present a novel approach to benchmark staleness in distributed datastores and use the approach to evaluate Amazon's Simple Storage Service (S3). We report on our unexpected findings.","PeriodicalId":376035,"journal":{"name":"Middleware for Service Oriented Computing","volume":"55 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-12-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131977239","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
The correctness and performance of large scale service oriented systems depend on distributed middleware components performing various communication and coordination functions. It is, however, very difficult to experimentally assess such middleware components, as interesting behavior often arises exclusively in large scale settings, but such deployments are costly and time consuming. We address this challenge with Minha, a system that virtualizes multiple JVM instances within a single JVM while simulating key environment components, thus reproducing the concurrency, distribution, and performance characteristics of the actual system. The usefulness of Minha is demonstrated by applying it to the WS4D Java stack, a popular implementation of the Devices Profile for Web Services (DPWS) specification.
{"title":"Experimental evaluation of distributed middleware with a virtualized Java environment","authors":"N. Carvalho, João Bordalo, F. Campos, J. Pereira","doi":"10.1145/2093185.2093188","DOIUrl":"https://doi.org/10.1145/2093185.2093188","url":null,"abstract":"The correctness and performance of large scale service oriented systems depend on distributed middleware components performing various communication and coordination functions. It is, however, very difficult to experimentally assess such middleware components, as interesting behavior often arises exclusively in large scale settings, but such deployments are costly and time consuming. We address this challenge with Minha, a system that virtualizes multiple JVM instances within a single JVM while simulating key environment components, thus reproducing the concurrency, distribution, and performance characteristics of the actual system. The usefulness of Minha is demonstrated by applying it to the WS4D Java stack, a popular implementation of the Devices Profile for Web Services (DPWS) specification.","PeriodicalId":376035,"journal":{"name":"Middleware for Service Oriented Computing","volume":"9 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-12-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116171599","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
As enterprises become more mobile, the need for a pervasive computing environment where their applications "follow the user" becomes increasingly important. This can be achieved by the client side simply adapting to changes in the environment (caused by mobility) by rebinding to equivalent services in the new environment or by choosing "'more suitable"' services as the operating context changes. However, the static, hard-wired nature of today's enterprise applications does not lend itself well to such dynamism. Service orientation provides a promising foundation for such computing models, where services are stateless and can be replaced on the fly. Much more needs to be done though - service orientation needs to be made adaptive where rebinding happens automatically driven by triggers caused by context changes. This impacts both the programming model that developers use to express the flexibility as well as the runtime (middleware) that interprets this expression and acts upon it. In this paper, we present a programming model and run time architecture for adaptive service orientation based on semantic descriptions of services and service elements (tasks) augmented with contextually dependent resource-based requirements.
{"title":"A middleware for adaptive service orientation in pervasive computing environments","authors":"N. Narendra, U. Bellur","doi":"10.1145/1890912.1890916","DOIUrl":"https://doi.org/10.1145/1890912.1890916","url":null,"abstract":"As enterprises become more mobile, the need for a pervasive computing environment where their applications \"follow the user\" becomes increasingly important. This can be achieved by the client side simply adapting to changes in the environment (caused by mobility) by rebinding to equivalent services in the new environment or by choosing \"'more suitable\"' services as the operating context changes. However, the static, hard-wired nature of today's enterprise applications does not lend itself well to such dynamism. Service orientation provides a promising foundation for such computing models, where services are stateless and can be replaced on the fly. Much more needs to be done though - service orientation needs to be made adaptive where rebinding happens automatically driven by triggers caused by context changes. This impacts both the programming model that developers use to express the flexibility as well as the runtime (middleware) that interprets this expression and acts upon it.\u0000 In this paper, we present a programming model and run time architecture for adaptive service orientation based on semantic descriptions of services and service elements (tasks) augmented with contextually dependent resource-based requirements.","PeriodicalId":376035,"journal":{"name":"Middleware for Service Oriented Computing","volume":"34 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-11-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132827279","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Monitoring the preservation of QoS properties during the operation of service-based systems at run-time is an important verification measure for checking if the current service usage is compliant with agreed SLAs. Monitoring, however, does not always provide sufficient scope for taking control actions against violations as it only detects violations after they occur. In this paper we describe a model-based prediction framework, EVEREST+, for both QoS predictors development and execution. EVEREST+ was designed to provide a framework for developing in an easy and fast way QoS predictors only focusing on their prediction algorithms implementation without the need for caring about how to collect or retrieve historical data or how to infer models out of collected data. It also provides a run-time environment for executing QoS predictors and storing their predictions.
{"title":"EVEREST+: run-time SLA violations prediction","authors":"Davide Lorenzoli, G. Spanoudakis","doi":"10.1145/1890912.1890915","DOIUrl":"https://doi.org/10.1145/1890912.1890915","url":null,"abstract":"Monitoring the preservation of QoS properties during the operation of service-based systems at run-time is an important verification measure for checking if the current service usage is compliant with agreed SLAs. Monitoring, however, does not always provide sufficient scope for taking control actions against violations as it only detects violations after they occur.\u0000 In this paper we describe a model-based prediction framework, EVEREST+, for both QoS predictors development and execution. EVEREST+ was designed to provide a framework for developing in an easy and fast way QoS predictors only focusing on their prediction algorithms implementation without the need for caring about how to collect or retrieve historical data or how to infer models out of collected data. It also provides a run-time environment for executing QoS predictors and storing their predictions.","PeriodicalId":376035,"journal":{"name":"Middleware for Service Oriented Computing","volume":"12 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-11-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129851175","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Web 2.0 applications allow individuals to manage their content online and to share it with other users and services on the Web. Such sharing requires access control to be put in place. Existing access control solutions, however, are unsatisfactory as they do not offer the functionality that users need in the open and user-driven Web environment. Additionally, such solutions are often custom-built and require substantial development effort, or use existing frameworks that provide benefits to developers only. New proposals such as User-Managed Access (UMA) show a promising solution to authorization for Web 2.0 applications. UMA puts the end user in charge of assigning access rights to Web resources. It allows users to share data more selectively using centralized authorization systems which make access decisions based on user instructions. In this paper, we present the UMA/j framework which implements the UMA protocol and allows users of Web applications to use their preferred authorization mechanisms. It also supports developers in building access control for their Web 2.0 applications by providing ready-to-use components that can be integrated with minimum effort.
Web 2.0应用程序允许个人在线管理他们的内容，并在Web上与其他用户和服务共享。这种共享需要适当的访问控制。然而，现有的访问控制解决方案并不令人满意，因为它们不能提供用户在开放和用户驱动的Web环境中所需的功能。此外，这样的解决方案通常是定制的，需要大量的开发工作，或者使用仅为开发人员提供好处的现有框架。用户管理访问(User-Managed Access, UMA)等新提议为Web 2.0应用程序的授权提供了一个很有前景的解决方案。UMA让最终用户负责为Web资源分配访问权限。它允许用户使用基于用户指令做出访问决策的集中式授权系统更有选择性地共享数据。在本文中，我们提出了UMA/j框架，它实现了UMA协议，并允许Web应用程序的用户使用他们首选的授权机制。它还支持开发人员为其Web 2.0应用程序构建访问控制，方法是提供可以轻松集成的即用组件。
{"title":"Design and implementation of user-managed access framework for web 2.0 applications","authors":"Maciej P. Machulak, Lukasz Moren, A. Moorsel","doi":"10.1145/1890912.1890913","DOIUrl":"https://doi.org/10.1145/1890912.1890913","url":null,"abstract":"Web 2.0 applications allow individuals to manage their content online and to share it with other users and services on the Web. Such sharing requires access control to be put in place. Existing access control solutions, however, are unsatisfactory as they do not offer the functionality that users need in the open and user-driven Web environment. Additionally, such solutions are often custom-built and require substantial development effort, or use existing frameworks that provide benefits to developers only.\u0000 New proposals such as User-Managed Access (UMA) show a promising solution to authorization for Web 2.0 applications. UMA puts the end user in charge of assigning access rights to Web resources. It allows users to share data more selectively using centralized authorization systems which make access decisions based on user instructions. In this paper, we present the UMA/j framework which implements the UMA protocol and allows users of Web applications to use their preferred authorization mechanisms. It also supports developers in building access control for their Web 2.0 applications by providing ready-to-use components that can be integrated with minimum effort.","PeriodicalId":376035,"journal":{"name":"Middleware for Service Oriented Computing","volume":"18 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-11-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126362040","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
With the emergence of public cloud storage platforms like Amazon, Microsoft and Google etc, individual applications and some enterprise storage are being increasingly deployed on Clouds. However, dynamic data sharing in public clouds face problems of low performance and lack of SLA guarantees. We propose a middleware called mCloud between the Cloud storage and clients to provide data sharing services with better performance and SLA satisfaction. Technologies including virtualization, chunking, and caching, are integrated into mCloud. Experiential results based on Amazon Web Services (AWS) have shown that mCloud is able to improve shared IO performance in term of aggregate IO throughput and help provide better SLAs for cloud storage.
随着亚马逊、微软和谷歌等公共云存储平台的出现，个人应用程序和一些企业存储越来越多地部署在云上。然而，公共云中的动态数据共享面临着性能低下和缺乏SLA保障的问题。我们在云存储和客户端之间提出了一个名为mCloud的中间件，以提供更好的性能和SLA满意度的数据共享服务。mCloud集成了虚拟化、分块和缓存等技术。基于Amazon Web Services (AWS)的经验结果表明，mCloud能够在聚合IO吞吐量方面提高共享IO性能，并有助于为云存储提供更好的sla。
{"title":"Middleware enabled data sharing on cloud storage services","authors":"Jianzong Wang, P. Varman, C. Xie","doi":"10.1145/1890912.1890918","DOIUrl":"https://doi.org/10.1145/1890912.1890918","url":null,"abstract":"With the emergence of public cloud storage platforms like Amazon, Microsoft and Google etc, individual applications and some enterprise storage are being increasingly deployed on Clouds. However, dynamic data sharing in public clouds face problems of low performance and lack of SLA guarantees. We propose a middleware called mCloud between the Cloud storage and clients to provide data sharing services with better performance and SLA satisfaction. Technologies including virtualization, chunking, and caching, are integrated into mCloud. Experiential results based on Amazon Web Services (AWS) have shown that mCloud is able to improve shared IO performance in term of aggregate IO throughput and help provide better SLAs for cloud storage.","PeriodicalId":376035,"journal":{"name":"Middleware for Service Oriented Computing","volume":"9 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-11-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122308787","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Paul Fremantle, S. Perera, A. Azeez, Sameera Jayasoma, Sumedha Rubasinghe, Ruwan Linton, S. Weerawarana, Samisa Abeysinghe
SOA proposes an architecture that composes many services together in a loosely coupled manner, and those services may provide a wide spectrum of features like implementing Business Logic, supporting Service Orchestration, Service Mediation, and Eventing, etc. Each user would, typically, choose a subset of these features and build his architecture on them. Although it is conceptually possible to fit all the features into the same server, due to performance and modularity concerns, the functionalities are broken across several servers and deployed rather than deploying as a single server. This paper presents Carbon, a component based server building framework that allows users to pick and choose different SOA concepts and build their own customized servers. Furthermore, the same framework enables those different features to share cross cutting concerns like storage, security, user interfaces, throttling, eventing etc., thus simplifying the server development process and reducing the footprint of the overall implementation. We present Carbon, the design decisions, and architecture while comparing and contrasting the proposed framework with other component based frameworks. The primary contributions of this paper are proposing a server building framework for SOA platform, taking initial steps towards defining and implementing such a framework, and sharing experiences of building and using the framework in real world settings. Furthermore, we propose a minimal kernel for SOA upon which the proposed platform can be constructed.
{"title":"Carbon: towards a server building framework for SOA platform","authors":"Paul Fremantle, S. Perera, A. Azeez, Sameera Jayasoma, Sumedha Rubasinghe, Ruwan Linton, S. Weerawarana, Samisa Abeysinghe","doi":"10.1145/1890912.1890914","DOIUrl":"https://doi.org/10.1145/1890912.1890914","url":null,"abstract":"SOA proposes an architecture that composes many services together in a loosely coupled manner, and those services may provide a wide spectrum of features like implementing Business Logic, supporting Service Orchestration, Service Mediation, and Eventing, etc. Each user would, typically, choose a subset of these features and build his architecture on them. Although it is conceptually possible to fit all the features into the same server, due to performance and modularity concerns, the functionalities are broken across several servers and deployed rather than deploying as a single server. This paper presents Carbon, a component based server building framework that allows users to pick and choose different SOA concepts and build their own customized servers. Furthermore, the same framework enables those different features to share cross cutting concerns like storage, security, user interfaces, throttling, eventing etc., thus simplifying the server development process and reducing the footprint of the overall implementation. We present Carbon, the design decisions, and architecture while comparing and contrasting the proposed framework with other component based frameworks. The primary contributions of this paper are proposing a server building framework for SOA platform, taking initial steps towards defining and implementing such a framework, and sharing experiences of building and using the framework in real world settings. Furthermore, we propose a minimal kernel for SOA upon which the proposed platform can be constructed.","PeriodicalId":376035,"journal":{"name":"Middleware for Service Oriented Computing","volume":"39 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-11-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134039013","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
With ubiquitous computing becoming reality there is a great potential of computing power in the surroundings. This can be provided by mobile devices such as mobile phones and PDAs building spontaneous networks. For service provisioning, Web services are an accepted standard. We advocate that these can also be used in ubiquitous scenarios. In this paper, we present SoapME, a novel SOAPbased Web service container for Java ME. SoapME is very lightweight and supports resource-limited devices running only Java ME CLDC. Unlike related work, it provides dynamic deployment of SOAP-based Web services at runtime. Our SoapME prototype provides several extension points, for instance for invocation interception. It shows reasonable performance on a mobile phone and is compliant to the standard SOAP test collection specification.
随着无处不在的计算成为现实，周围环境的计算能力具有巨大的潜力。这可以通过移动设备，如移动电话和pda建立自发网络来提供。对于服务供应，Web服务是一种可接受的标准。我们主张这些也可以用于无处不在的场景。在本文中，我们介绍了SoapME，一种用于Java ME的新颖的基于soap的Web服务容器。SoapME非常轻量级，支持只运行Java ME CLDC的资源有限的设备。与相关工作不同，它在运行时提供基于soap的Web服务的动态部署。我们的SoapME原型提供了几个扩展点，例如用于调用拦截。它在移动电话上显示了合理的性能，并且符合标准SOAP测试集合规范。
{"title":"SoapME: a lightweight Java ME web service container","authors":"Holger Schmidt, Andreas Köhrer, F. Hauck","doi":"10.1145/1462802.1462805","DOIUrl":"https://doi.org/10.1145/1462802.1462805","url":null,"abstract":"With ubiquitous computing becoming reality there is a great potential of computing power in the surroundings. This can be provided by mobile devices such as mobile phones and PDAs building spontaneous networks. For service provisioning, Web services are an accepted standard. We advocate that these can also be used in ubiquitous scenarios.\u0000 In this paper, we present SoapME, a novel SOAPbased Web service container for Java ME. SoapME is very lightweight and supports resource-limited devices running only Java ME CLDC. Unlike related work, it provides dynamic deployment of SOAP-based Web services at runtime. Our SoapME prototype provides several extension points, for instance for invocation interception. It shows reasonable performance on a mobile phone and is compliant to the standard SOAP test collection specification.","PeriodicalId":376035,"journal":{"name":"Middleware for Service Oriented Computing","volume":"4 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127690960","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Cássio M. M. Pereira, D. C. Lobato, C. Teixeira, M. G. Pimentel
Causal and total event ordering are Quality of Service guarantees needed by many distributed applications, such as collaborative whiteboards, chat systems, online multiplayer games, and has also usage when implementing active replication, replicated databases and other systems. Most state of the art Publish/Subscribe middlewares offer no guarantees regarding event ordering either because of the bandwidth overhead associated with the vector clock approach or the bottleneck of a central sequencer. In this paper we propose an architecture based on distributed shared memory, where publishers of the same group can publish at different brokers, while maintaining event ordering. By synchronizing broker access to one shared logical clock per group, causal and total event ordering is achieved. Our architecture allows events to be delivered out-of-order to subscribers, while giving them a way to correctly reorder events. Results of experiments with a reference implementation of the architecture show that the bandwidth consumption of our ordering mechanism can be three orders of magnitude lower than a vector based solution.
{"title":"Achieving causal and total ordering in publish/subscribe middleware with DSM","authors":"Cássio M. M. Pereira, D. C. Lobato, C. Teixeira, M. G. Pimentel","doi":"10.1145/1462802.1462813","DOIUrl":"https://doi.org/10.1145/1462802.1462813","url":null,"abstract":"Causal and total event ordering are Quality of Service guarantees needed by many distributed applications, such as collaborative whiteboards, chat systems, online multiplayer games, and has also usage when implementing active replication, replicated databases and other systems. Most state of the art Publish/Subscribe middlewares offer no guarantees regarding event ordering either because of the bandwidth overhead associated with the vector clock approach or the bottleneck of a central sequencer. In this paper we propose an architecture based on distributed shared memory, where publishers of the same group can publish at different brokers, while maintaining event ordering. By synchronizing broker access to one shared logical clock per group, causal and total event ordering is achieved. Our architecture allows events to be delivered out-of-order to subscribers, while giving them a way to correctly reorder events. Results of experiments with a reference implementation of the architecture show that the bandwidth consumption of our ordering mechanism can be three orders of magnitude lower than a vector based solution.","PeriodicalId":376035,"journal":{"name":"Middleware for Service Oriented Computing","volume":"43 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124535854","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
The aim of the SOAJA project (Service Oriented Adaptive Java Applications) is to develop a service-oriented infrastructure enabling efficient application running in complex, networked computing environments (GRID). The SOAJA infrastructure provides components and services enabling static and dynamic load balancing through Java object observation. SOAJA performs large scale computing using idle CPU time of the nodes of a GRID. Java Distributed Applications consist of many objects which are processed in parallel which SOAJA allocates to each Grid nodes at runtime. In this paper, we present the mechanisms and algorithms which ensures the automatic adaptation of the application objects, in response to the computing evolutions and to modifications of the resource availability. These mechanisms permit to control the granularity of the treatment and the distribution of the application on the Grid platform.
{"title":"Service oriented adaptive Java applications","authors":"I. Alshabani, R. Olejnik, B. Toursel","doi":"10.1145/1462802.1462810","DOIUrl":"https://doi.org/10.1145/1462802.1462810","url":null,"abstract":"The aim of the SOAJA project (Service Oriented Adaptive Java Applications) is to develop a service-oriented infrastructure enabling efficient application running in complex, networked computing environments (GRID). The SOAJA infrastructure provides components and services enabling static and dynamic load balancing through Java object observation. SOAJA performs large scale computing using idle CPU time of the nodes of a GRID. Java Distributed Applications consist of many objects which are processed in parallel which SOAJA allocates to each Grid nodes at runtime. In this paper, we present the mechanisms and algorithms which ensures the automatic adaptation of the application objects, in response to the computing evolutions and to modifications of the resource availability. These mechanisms permit to control the granularity of the treatment and the distribution of the application on the Grid platform.","PeriodicalId":376035,"journal":{"name":"Middleware for Service Oriented Computing","volume":"51 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114459526","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
京公网安备 11010802042870号
京ICP备2023020795号-1
扫码关注我们
求助内容：
应助结果提醒方式：