Web service is a distributed computing model which has characteristics of loose coupling, self-description and strong self-government, how to evaluate the degree of Web service security is a challenging problem. On th...
详细信息
The proceedings contain 15 papers. The topics discussed include: follow the data: concurrent execution pattern;patterns for cache optimizations on multi-processor machines;a pattern for efficient parallel computation ...
ISBN:
(纸本)9781605588735
The proceedings contain 15 papers. The topics discussed include: follow the data: concurrent execution pattern;patterns for cache optimizations on multi-processor machines;a pattern for efficient parallel computation on multicore processors with scalar operand networks;ghost cell pattern;three layer cake for shared-memory programming;patterns of optimized loops;concurrent evaluation of a directed acylic graph;the task graph pattern;a design pattern language for engineering (parallel) software: merging the PLPP and OPL projects;parallel sorting pattern;mechanisms that separate algorithms from implementations for parallel patterns;towards using and improving the NAS parallel benchmarks: a parallel patterns approach;a pattern language for parallelizing irregular algorithms;and monte carlo methods: a computational pattern for our pattern language.
We present the design and implementation of a generic framework for cooperative multi-issue one-to-many negotiations for optimal service provisioning in collaborative disaster management information systems. The frame...
详细信息
In this paper, we explore hybrid parallel global optimization using Dividing Rectangles (DIRECT) and asynchronous generating set search (GSS). Both DIRECT and GSS are derivative-free and so require only objective func...
详细信息
In this paper, we explore hybrid parallel global optimization using Dividing Rectangles (DIRECT) and asynchronous generating set search (GSS). Both DIRECT and GSS are derivative-free and so require only objective function values;this makes these methods applicable to a wide variety of science andengineering problems. DIRECT is a global search method that strategically divides the search space into ever-smaller rectangles, sampling the objective function at the centre point for each rectangle. GSS is a local search method that samples the objective function at trial points around the current best point, i.e. the point with the lowest function value. Latin hypercube sampling can be used to seed GSS with a good starting point. Using a set of global optimization test problems, we compare the parallel performance of DIRECT and GSS with hybrids that combine the two methods. Our experiments suggest that the hybrid methods are much faster than DIRECT and scale better when more processors are added. This improvement in performance is achieved without any sacrifice in the quality of the solution - the hybrid methods find the global optimum whenever DIRECT does.
IT service providers face a great need to improve the quality of services by IT service management (ITSM) in highly complex IT Environments. This pressure demands a strong collaboration from both the external service ...
详细信息
Network calculus is a promising theory for analyzing and modeling networks based on min-plus algebra. Using network calculus theory, we propose formulas of arrival curve and service curve for end-to-end communication,...
详细信息
The issue of providing Quality of Service (QoS) guarantees in an Ad hoc wireless network is a very challenging problem. In this paper, we make the following contributions: (i) analytically derive bounds for the end-to...
详细信息
The issue of providing Quality of Service (QoS) guarantees in an Ad hoc wireless network is a very challenging problem. In this paper, we make the following contributions: (i) analytically derive bounds for the end-to-end call acceptance rate using existing queueing theory methods, (ii) study the impact of the routing scheme on the end-to-end call acceptance rate, and (iii) propose a differentiated services scheme for deterministically providing QoS guarantees. Unlike the existing studies which analyze the transport capacity, we focus on the end-to-end call acceptance. The framework that we assume is that of a TDMA based Ad hoc wireless network. The routing scheme employed influences the end-to-end call acceptance of the network. The metrics that we consider are the call acceptance probability and the system saturation probability (i.e., the probability that the network is in a state in which every new call is rejected). We derive general bounds on the call acceptance and the system saturation for the case of differentiated-classes of users in the network. These bounds indicate the number of calls of the highest priority class that can be admitted into the network. Simulation studies were carried out to study the effect of load, hopcount, and the influence of the routing protocol on the call acceptance. The increase in the call acceptance rate with the introduction of load-balancing highlights the importance of load-balancing in enhancing the system performance. From these studies, we arrive at the following results: (i) load-balancing leads to significant improvement in the end-to-end call acceptance rate, and is an important factor in attaining the maximum end-to-end call acceptance rate in a given network and (ii) it is indeed possible to provide deterministic QoS guarantees for a designated set of nodes which are characterized by “deterministic guarantee limit”.
The paper describes a generic, open-source infrastructure called SearchBestie (or S'Bestie for short) that we propose as a platform for experimenting with search-based techniques and for applying them in the area ...
详细信息
ISBN:
(纸本)9781450301367
The paper describes a generic, open-source infrastructure called SearchBestie (or S'Bestie for short) that we propose as a platform for experimenting with search-based techniques and for applying them in the area of software testing. Further, motivated by a lack of work on search-based testing targeted at identifying concurrency-related problems, we instantiate S'Bestie for search-based testing of concurrent programs using the IBM's concurrency testing infrastructure called ConTest. We demonstrate on series of experiments the capabilities of S'Bestie and (despite we have just made our first experiments with S'Bestie) also the fact that using search-based testing in the context of testing concurrent programs can be useful. Copyright 2010 ACM.
software applications are increasingly situated in a world where context changes continuously. At the same time, applications need to provide continuous service, and the service provided often needs to change in order...
详细信息
Along with the development of grid computing and cloud computing, finite computing resources supplied by standalone server usually become the bottleneck in the process of system implementation of online trading platfo...
详细信息
暂无评论