The success of the autonomic computing vision [Kephart03] relies in its capacity of correlating heterogeneous resources such as databases, switches, routers, server systems, load balancers, web servers and/or applicat...
详细信息
ISBN:
(纸本)9780769528090
The success of the autonomic computing vision [Kephart03] relies in its capacity of correlating heterogeneous resources such as databases, switches, routers, server systems, load balancers, web servers and/or application servers are just a few possibilities of resources that coexist in a data center today. These resources are provided by multiple vendors, and consequently implement different manageability interfaces. This multiplicity of resources also requires an ecosystem of multiple different management applications, delivered by a number of different management application vendors. many of these vendors are now re-engineering their management infrastructure to become more autonomic and achieve the inherent value associated to a more independent management solution. Unfortunately many of the existing autonomic capabilities today are point solutions that are not easily integrated in a multi-vendor environment, nor emphasize the necessary collaboration. A true multi-vendor autonomic solution would enable the sharing and reuse of management information between heterogeneous management applications. In this paper we argue in favor of formalizing resource representations in a way that allows for automatic negotiation and integration of heterogeneous resources. We propose the use of formal ontology as a conceptual model in which to represent IT resources and present CATO, an ontology integration engine developed to provide semantic interoperability among resources in a heterogeneous environment.
Traditional parallel programming styles have man), problems which hinder the development of parallel applications. The message passing style can be too complex for many programmers. While shared memory based parallel ...
详细信息
ISBN:
(纸本)9780769528335
Traditional parallel programming styles have man), problems which hinder the development of parallel applications. The message passing style can be too complex for many programmers. While shared memory based parallel programming is relatively easy, it requires programmers to guarantee there is no data race in programs by using mutually exclusive locks. Data race conditions are generally difficult to debug and difficult to prevent as well. The View-Oriented Parallel Programming (VOPP) is a novel shared-memory-based programming style. It removes the burden of guaranteeing data race free from the programmers. With the VOPP approach, shared data objects in a parallel program are divided into views according to the memory access pattern of the parallel algorithm. Data race is not an issue in VOPP since mutual exclusion is automatically,, done by the underlying system when a view is accessed. The programmer only needs to synchronize the access of views using synchronization primitives like barriers. By removing data races of view access, VOPP makes it easier to code and less difficult to debug programs. It provides potential performance advantages on multi-coresystems as well as cluster computers. It will also provide useful information for efficient implementation of transactional memory.
The trend of increasing speed and complexity in the single-core processor as stated in the Moore's law is facing practical challenges. As a result, the multi-core processor architecture has emerged as the dominant...
详细信息
With the increased realisation of the benefits of studying environmental data, sensor networks are rapidly scaling in size, heterogeneity of data, and applications. In this paper, we present a State-based Publish/Subs...
详细信息
ISBN:
(纸本)9781595939302
With the increased realisation of the benefits of studying environmental data, sensor networks are rapidly scaling in size, heterogeneity of data, and applications. In this paper, we present a State-based Publish/Subscribe (SPS) framework for sensor systems with many distributed and independent application clients. SPS provides a state-based information deduction model that is suited to many classes of sensor network applications. State Maintenance Components (SMCs) are introduced that are simple in operation, flexible in placement, and decomposable for distributed processing. Publish/Subscribe communication forms the core messaging component of the framework. SPS uses the decoupling feature of Pub/Sub and extends this across the SMCs to support a more flexible and dynamic system structure. Our evaluation, using real sensor data, shows that SPS is expressive in capturing conditions, and scalable in performance. Copyright 2007 ACM.
In this paper we consider the problem of maximising utility in linked market-driven distributed and Grid systems. In such systems, users submit jobs through brokers who can virtualise and make available the resources ...
详细信息
ISBN:
(纸本)9781595939449
In this paper we consider the problem of maximising utility in linked market-driven distributed and Grid systems. In such systems, users submit jobs through brokers who can virtualise and make available the resources of multiple service providers, achieving greater economies of scale, improving throughput and potentially reducing cost. Customers compete against each other by assigning a utility value or function to the successful processing of their jobs in an effort to have them prioritised in the face of contested and constrained resources. Brokers and service providers also attempt to maximise the utility they gain, choosing to process jobs that will earn them the highest profit with respect to the resources required. For this to be effective over many linked computing marketplaces highly distributed resource allocation is needed, where each participant can operate independently using only local information, and ideally reach a global state where all participants are satisfied. We model such a system by adapting the classical multi-commodity flow problem to the market-based, utility driven distributed systems, where all participants selfishly attempt to maximise their own gain. We then obtain a utility-aware distributed algorithm that generates increased utility for participants in such systems, especially under scenarios of high contention. Copyright 2007 ACM.
As we enter the many-core era, the interconnection networks of a computer system, rather than the processor or memory modules, will dominate its performance. Several recent developments in interconnection network arch...
详细信息
Biological processes occurring inside cell involve multiple scales of time and length;many popular theoretical and computational multi-scale techniques utilize biomolecular simulations based on molecular dynamics. Til...
详细信息
The Increasing adoption of the techniques of mobile wireless ad hoc network in the field of civilian applications arouses many urgent problems. As we known nodes to consist a MANET may belong to different users, thus ...
详细信息
ISBN:
(纸本)9781424413119
The Increasing adoption of the techniques of mobile wireless ad hoc network in the field of civilian applications arouses many urgent problems. As we known nodes to consist a MANET may belong to different users, thus each node aims to pursue the best quality of service for its owner, i.e., they are self-interested nodes trying to achieve the maximum utility. Researchers have shown that selfish nodes in a MANET can greatly decrease the performance of the network, even to the point where no messages can be sent at all. By the similarities between MANET and multi-agent system (MAS), to research some problems in MANET from the view of MA S is an impressive idea. In this paper nodes in MANET are modeled as intelligent agents using an agent programming language named Conceptual Agent Notation (CAN). We don't use CAN directly but extend its semantics with a set of core operations which capture the essence of ad hoc network, thus provide some solid theoretic underpinning for researching MANET from the view of MAS.
The proceedings contain 10 papers. The topics discussed include: a QoS-based selection approach of autonomic grid services;approaching a parallelized XML parser optimized for multi-coreprocessors;benefits of alternate...
详细信息
ISBN:
(纸本)159593717X
The proceedings contain 10 papers. The topics discussed include: a QoS-based selection approach of autonomic grid services;approaching a parallelized XML parser optimized for multi-coreprocessors;benefits of alternate XML serialization formats in scientific computing;parallel XML processing by work stealing;comparing semantic registries: OWLJessKB and InstanceStore;SISC: providing efficient XML-based service-orientation for core OS functionality;empowering distributed workflow with the data capacitor: maximizing lustre performance across the wide area network;data transfer performance issues for a web services interface to synchrotron experiments;and comparing the use of bayesian networks and neural networks in response time modeling for service-oriented systems.
The application of the biological metaphor of the autonomic nervous system to computing has created the paradigm of autonomic computing, in which computer systems self-regulate by using automatic reactions to defend, ...
详细信息
The application of the biological metaphor of the autonomic nervous system to computing has created the paradigm of autonomic computing, in which computer systems self-regulate by using automatic reactions to defend, optimize and heal. Agent technologies have been highlighted in the literature as particularly appropriate for the development of autonomic systems. This paper reports on an investigation of the use of the autonomic concepts of reflex autonomicity and apoptosis in the development of a multi-agent system. Findings are discussed with reference to the use of the JADE agent platform for development
暂无评论