Analyzing the performance impact of temporal dependent workloads on hardware and softwaresystems is a challenging task that yet must be addressed to enhance performance of real applications. For instance, existing ma...
详细信息
Analyzing the performance impact of temporal dependent workloads on hardware and softwaresystems is a challenging task that yet must be addressed to enhance performance of real applications. For instance, existing matrix-analytic queueing models can capture temporal dependence only in systems that can be described by one or two queues, but the capacity planning of real multi-tier architectures requires larger models with arbitrary topology. To address the lack of a proper modeling technique for systems subject to temporal dependent workloads, we introduce a class of closed queueing networks where service times can have non-exponential distribution and accurately approximate temporal dependent features such as short or long range dependence. We describe these service processes using Markovian arrival processes (MAPs), which include the popular Markov-modulated Poisson processes (MMPPs) as special cases. Using a linear programming approach, we obtain for MAP closed networks tight upper and lower bounds for arbitrary performance indexes (e.g., throughput, response time, utilization). Numerical experiments indicate that our bounds achieve a mean accuracy error of 2% and promote our modeling approach for the accurate performance analysis of real multi-tier architectures.
Dynamic software adaptation addresses softwaresystems that need to change their behavior during execution. To address reuse in dynamic software adaptation, software adaptation patterns, also referred to as software r...
详细信息
Dynamic software adaptation addresses softwaresystems that need to change their behavior during execution. To address reuse in dynamic software adaptation, software adaptation patterns, also referred to as software reconfiguration patterns, have been developed. A software adaptation pattern defines how a set of components that make up an architecture or design pattern dynamically cooperate to change the software configuration to a new configuration given a set of adaptation commands. This paper describes a dynamic self-adaptation pattern for distributed transaction management in service-oriented applications.
This paper presents a fast preemptive list heuristic scheduling algorithm, called the Fast Preemptive Scheduling Algorithm (FPS), for both homogeneous and heterogeneous distributed memory systems. Time complexity of F...
详细信息
ISBN:
(纸本)9780769532639
This paper presents a fast preemptive list heuristic scheduling algorithm, called the Fast Preemptive Scheduling Algorithm (FPS), for both homogeneous and heterogeneous distributed memory systems. Time complexity of FPS is just O(|V|*(log|V|+log|P|)+|E|). Such an algorithm is useful during the compilation of the parallel applications. A preemptive schedule can better utilize the resources and offers a lot of flexibility. In order to schedule tasks, FPS simulates preemptive task execution at a very low overhead and requires very little runtime support. The experimental results show that, the scheduling cost of FPS is lower than that of other well known non-preemptive and preemptive list heuristic scheduling algorithms for both homogeneous and heterogeneous systems. Also the scheduling performance of FPS is same or better than that of those algorithms.
With the rapid development of the internet and the increasing demand for communication, customized routing has become one of the hot research topics in future network. In order to better meet various communication req...
详细信息
Knowledge interconnection, which is a method from the point of knowledge discovery, plays an important role in many knowledge systems such as natural language query system and intelligence tutor system. The paper firs...
详细信息
Knowledge interconnection, which is a method from the point of knowledge discovery, plays an important role in many knowledge systems such as natural language query system and intelligence tutor system. The paper firstly discussed some kinds of interconnectivities of two closed-semantic statements with the form by analyzing the properties of binary semantic relations and the implications among semantic relations. These implications can be acquired by using the attribute exploration algorithm in formal concept analysis (FCA). And then the paper proposed an interactive interconnection algorithm, which is used to judge whether there exist meaningful interconnection factor between two statements.
In Order to increase the overall performance, we have studied methods for improving load prediction, which would help improve load balancing in the Grid. Current software designed to handle distributed applications do...
详细信息
Message sequence charts (MSCs) are a technique to describe patterns of interaction between the components of interactive distributedsystems by specific diagrams. In this paper, we suggest a semantic model for MSCs in...
详细信息
Message sequence charts (MSCs) are a technique to describe patterns of interaction between the components of interactive distributedsystems by specific diagrams. In this paper, we suggest a semantic model for MSCs in terms of stream processing functions. This formalization allows us to use MSCs as an intuitively clear specification technique for the components of a system with a precisely defined meaning.
Good IT decision making is a highly desirable property that can be furthered by the use of enterprise architecture, an approach to IT management using diagrammatic models. In order to support decision making, the mode...
详细信息
Good IT decision making is a highly desirable property that can be furthered by the use of enterprise architecture, an approach to IT management using diagrammatic models. In order to support decision making, the models must contain only relevant information since creation of enterprise architecture models often is a demanding task. This paper suggests a method for constructing an enterprise architecture model framework where enterprises in need of architecture and rational decision making are designated. The paper also describes the outcome of the method at a case for a Swedish utility company, Vattenfall AB.
Reliability has recently become an important issue in PC cluster technology. This research proposes a softwaredistributed shared memory system, named SCASH-FT, as an execution platform for high performance and highly...
详细信息
Reliability has recently become an important issue in PC cluster technology. This research proposes a softwaredistributed shared memory system, named SCASH-FT, as an execution platform for high performance and highly reliable parallel system for commodity PC clusters. To achieve fault tolerance, each node has redundant page data that allows recovery from node failure using SCASH-FT. All page data is checkpointed and duplicated to another node when a user explicitly calls the checkpoint function. When failure occurs, SCASH-FT invokes the rollback function by restarting an execution from the last checkpoint data. SCASH-FT takes charge of processes such as detecting failure and restarting execution. So, all you have to do is just adding checkpoint function calls in the source code to determine the timing of each checkpoint. Evaluation results show that the checkpoint cost and the rollback penalty depend on the data access pattern and the checkpoint frequency. Thus, users can control their application performance by adjusting checkpoint frequency.
In the bigdata era, metadata performance is critical in modern distributed file systems. Traditionally, the metadata management strategies like the subtree partitioning method focus on keeping namespace locality, whil...
详细信息
暂无评论