In order to support very high capability storage systems, a peer-to-peer distributed file system architecture has been developed along with a prototype implementation. Current systems may have difficulty providing vir...
详细信息
ISBN:
(纸本)1932415262
In order to support very high capability storage systems, a peer-to-peer distributed file system architecture has been developed along with a prototype implementation. Current systems may have difficulty providing virtual data storage services because they typically only depend on trusted nodes in a local network. To support utilization of nodes beyond a local network, trusted nodes across the Internet need to be used with characteristics along the lines of scalability, availability and becoming profitable if the services are available to paid customers. In this paper we present a novel adaptive rule-based peer-to-peer distributed file system which is able to build a trusted distributed file system environment and enables users to securely store and retrieve their files at either trusted storage nodes or untrusted nodes that are located across the network. We further present some interesting results obtained when a rouge node is presented to the system.
With the development of information technology, real-time data stream processing(RTDSP) has become a popular research topic. The first step of RTDSP is collecting data, requiring a data collector to receive data from ...
详细信息
ISBN:
(纸本)9781538637906
With the development of information technology, real-time data stream processing(RTDSP) has become a popular research topic. The first step of RTDSP is collecting data, requiring a data collector to receive data from the source and send them to the sink. Apache Flume, a distributed and reliable framework, used for this purpose, has some limitations and drawbacks on load balancing and storage. In this paper, we aim to improve performance and availability for collecting unstable real-time big data stream. So we propose a new load balancing strategy based on the free memory size and a storage strategy of integration memory channel with the multi-file channel to reduce the overhead of disk and network. Finally, the experimental results show that the availability and performance are improved under the condition of a poor network, high availability requirements, intense competition in memory resources and large data size. Specifically, the availability is higher than 99.999%, and the performance can be improved by 10%-50% under different conditions.
Waves are everywhere;countless natural phenomena are composed of waves or interact with waves in some way. Light, sound, earthquakes, oceanic waves - all are examples of waves. Since waves are so ubiquitous, it is of ...
详细信息
ISBN:
(纸本)1892512416
Waves are everywhere;countless natural phenomena are composed of waves or interact with waves in some way. Light, sound, earthquakes, oceanic waves - all are examples of waves. Since waves are so ubiquitous, it is of great importance for scientists and engineers to study and model them. For example, a seismologist might want to model an earthquake's Shockwave. The wave simulator described in this document is designed to simulate such a situation, i.e., the propagation of an acoustic wave through a medium of varying density. It models the wave's propagation in two dimensions, using a finite difference method and absorbing boundary conditions. In order to accommodate large sets of data over many time iterations and to model such data in a tractable amount of time, the simulator is parallelized using MPI. The output is displayed visually as an animation over a three-dimensional surface, in which the z-axis represents the density of the medium;the wave can be seen as a displacement in density over the medium.
The wireless channels are most important resources in a mobile computing system. Each communication session that involves a mobile host requires a channel to be allocated. The possibility of reuse of wireless channels...
详细信息
ISBN:
(纸本)1892512416
The wireless channels are most important resources in a mobile computing system. Each communication session that involves a mobile host requires a channel to be allocated. The possibility of reuse of wireless channels in different cells subject to satisfying the reuse constraint is the main concern for optimizing the channel usage in the mobile computing system. The problem resembles with mutual exclusion problem with some additional constraints that the same resources can be reused beyond the cell's interference region. We present a formal model for channel allocation problem in a distributed mobile computing system using Duration Calculus (DC) as a special mutual exclusion concept. We propose a new distributed dynamic channel allocation algorithm based on the formal model. The proposed algorithm attempts to bring the best features of the permission-based and token-based principles of mutual exclusion.
The distributed QoS Network Scheduler (DQNS) is used to schedule paths over a mobile, IP or optical network. The scheduler is intelligent enough to adapt to the ever-changing network conditions and aims to serve the p...
详细信息
ISBN:
(纸本)1932415262
The distributed QoS Network Scheduler (DQNS) is used to schedule paths over a mobile, IP or optical network. The scheduler is intelligent enough to adapt to the ever-changing network conditions and aims to serve the path requests based on a cost equation. DQNS is more than a scheduler as it does QoS routing and resource allocation in addition to the scheduling. Being a generic framework, DQNS gives the flexibility to replace the components and hence can be fine-tuned to match the network behavior. It is a distributed entity, which does the scheduling based on the information collected from various scheduling agents. Each scheduling agent obtains QoS information from a local QoS monitor. DQNS employs crawler objects to scan the scheduling agents and retrieve QoS information for a specified path. This information is used to provide QoS guarantees to clients requesting for a path with specific QoS requirements.
Many embedded multi-core systems incorporate both dataflow applications with timing constraints and traditional real-time applications. Applying real-time scheduling techniques on such systems provides real-time guara...
详细信息
ISBN:
(纸本)9781479984909
Many embedded multi-core systems incorporate both dataflow applications with timing constraints and traditional real-time applications. Applying real-time scheduling techniques on such systems provides real-time guarantees that all running applications will execute safely without violating their deadlines. However, to apply traditional real-time scheduling techniques on such mixed systems, a unified model to represent both types of applications running on the system is required. Several earlier works have addressed this problem and solutions have been proposed that address acyclic graphs, implicit-deadline models or are able to extract timing parameters considering specific scheduling algorithms. In this paper, we present an algorithm for extracting real-time parameters (offsets, deadlines and periods) that are independent of the schedulability analysis, other applications running in the system, and the specific platform. The proposed algorithm: 1) enables applying traditional real-time schedulers and analysis techniques on cyclic or acyclic Homogeneous Synchronous Dataflow (HSDF) applications with periodic sources, 2) captures overlapping iterations, which is a main characteristic of the execution of dataflow applications, 3) provides a method to assign offsets and individual deadlines for HSDF actors, and 4) is compatible with widely used deadline assignment techniques, such as NORM and PURE. The paper proves the correctness of the proposed algorithm through formal proofs and examples.
Inter-operability in heterogeneous distributed systems is often provided with the help of CORBA compliant middleware. Many distributed Object Computing Systems, however, are characterized by limited heterogeneity. Suc...
详细信息
ISBN:
(纸本)0769516777
Inter-operability in heterogeneous distributed systems is often provided with the help of CORBA compliant middleware. Many distributed Object Computing Systems, however, are characterized by limited heterogeneity. Such systems often contain a subset of components that are written in the same programming language and run on top of the same platform. We present engineering techniques that exploit such limited heterogeneity in systems for achieving high system performance. With these techniques components implemented using diverse programming languages and/or platform use a CORBA compliant middleware, whereas the similar components can use a "Flyover" that employs a separate path between the client and its server and avoids a number of CORBA overheads. Insights into system behavior and performance gained from results of experiments with synthetic workload running on a network of PC's are presented.
Traditional distributed schedulers only consider the scheduling of jobs and treat the storage system as static and already deployed. However, individual application often needs its own configuration of storage system....
详细信息
ISBN:
(纸本)9781467375894
Traditional distributed schedulers only consider the scheduling of jobs and treat the storage system as static and already deployed. However, individual application often needs its own configuration of storage system. Therefore, traditional distributed schedulers are not able to serve multiple tenants. To improve the resource utilization, some mechanisms are needed to consolidate multiple applications running on top of the same computing resources. Flex is such a system for helping the distributed scheduler to deploy a customized storage system before a job is scheduled without too much overhead incurred. The lightweight operating system level virtualization technology, aka containers in Linux, is used to wrap the computing environment and isolate different applications. Flex can achieve two goals that traditional distributed scheduler cannot provide. One is to deploy a specific storage system for the requirement of an individual application;the other is to consolidate applications for a better use of the underlying computing resources. Thus, by employing storage scheduling, Flex improves the resource utilization of distributed systems.
The recursive circulant network(RCN) can be widely used in the design and implementation of parallelprocessing architectures. In this paper, we investigate the routing of a message on RCN, that is a key to the perfor...
详细信息
ISBN:
(纸本)1601320841
The recursive circulant network(RCN) can be widely used in the design and implementation of parallelprocessing architectures. In this paper, we investigate the routing of a message on RCN, that is a key to the performance of RCN. On a recursive circulant network we would like to transmit m packets from a source node to m destination node simultaneously along paths on this network, the ith packet will traverse along the ith path (0 ≤ i ≤ m - 1). In order for all packets to arrive at a destination node quickly and securely, we construct a set of m node-disjoint paths each being shortest or near shortest and the total length is minimum. To accomplish this, we present O(m3) one-to-many parallel routing algorithm on RCN employing the Hungarian method.
Graph problems are finding increasing applications in high performance computing disciplines. Although many regular problems can be solved efficiently in parallel, obtaining efficient implementations for irregular gra...
详细信息
ISBN:
(纸本)9783540747413
Graph problems are finding increasing applications in high performance computing disciplines. Although many regular problems can be solved efficiently in parallel, obtaining efficient implementations for irregular graph problems remains a challenge. We propose techniques for designing and implementing efficient parallel algorithms for graph problems on symmetric multiprocessors and chip multiprocessors with a case study of parallel tree and connectivity algorithms. The problems we study represent a wide range of irregular problems that have fast theoretic parallel algorithms but no known efficient parallel implementations that achieve speedup without serious restricting assumptions about the inputs. We believe our techniques will be of practical impact in solving large-scale graph problems.
暂无评论