With the rapid development of the Internet, applications in distributedprocessing systems have attracted more and more attention. The privacy protection is one of the most important factors to ensure the security of ...
详细信息
ISBN:
(纸本)9781538637906
With the rapid development of the Internet, applications in distributedprocessing systems have attracted more and more attention. The privacy protection is one of the most important factors to ensure the security of underlying networks in a distributed computing system. Users expect to use a service (e.g., a computing service) anonymously, while service providers want to make sure that the users are trusted and their behavior can be accountable. Given that these two factors are contradictory, how to provide an efficient solution to achieve trusted anonymous access to the services in distributed computing networks is a challenging task. In a distributed computing system, when a task needs to be computed by a worker (or server), the transmitted data over the underlying network to perform this computing service might include many different contents, and even lots of different flows. To this end, this paper presents a new and efficient architecture to help users use services anonymously in distributed computing networks, without loss of trustworthiness. The experimental results show that the proposed architecture introduces acceptable overheads, and can achieve the goal of balancing anonymity and trust in distributed computing networks.
High Performance Computing (HPC) demand is on the rise, particularly for large distributed computing. HPC systems have, by design, very heterogeneous architectures, both in computation and in communication bandwidth, ...
详细信息
ISBN:
(纸本)9781450362955
High Performance Computing (HPC) demand is on the rise, particularly for large distributed computing. HPC systems have, by design, very heterogeneous architectures, both in computation and in communication bandwidth, resulting in wide variations in the cost of communications between compute units. If large distributedapplications are to take full advantage of HPC, the physical communication capabilities must be taken into consideration when allocating workload. Hypergraphs are good at modelling total volume of communication in parallel and distributedapplications. To the best of our knowledge, there are no hypergraph partitioning algorithms to date that are architecture-aware. We propose a novel restreaming hypergraph partitioning algorithm (HyperPRAW) that takes advantage of peer to peer physical bandwidth profiling data to improve distributedapplications performance in HPC systems. Our results show that not only the quality of the partitions achieved by our algorithm is comparable with state-of-the-art multilevel partitioning, but that the runtime performance in a synthetic benchmark is significantly reduced in 10 hypergraph models tested, with speedup factors of up to 14x.
techniques of customizing and extending operating systems (OSs) have a growing impact on system architectures in the field of distributed computing and parallel programming. Even if traditional methods of adaption hav...
详细信息
ISBN:
(纸本)0780342291
techniques of customizing and extending operating systems (OSs) have a growing impact on system architectures in the field of distributed computing and parallel programming. Even if traditional methods of adaption have been limited to the user-level, modern OSs cannot do without kernel support. Hence concepts and structures of microkernel architectures must be redefined to meet the requirements of today's and future applications. In this paperwork we are proposing a new customizable low-level OS architecture - the Dycos kernel. In a first part we will discuss customization demands on microkernels. In a second part we are passing over to describe the basic kernel concept. Dycos is an object-based approach providing a toolbox of operations to build user-definable compositions of kernel structures. The Dycos approach has been evaluated on a Solaris 2.5.1 platform.
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.
Approximations and redundancies allow mobile and distributedapplications to produce answers or outcomes of lesser quality at lower costs. This paper introduces RAPID, a new programming framework and methodology for s...
详细信息
ISBN:
(纸本)9781509067640
Approximations and redundancies allow mobile and distributedapplications to produce answers or outcomes of lesser quality at lower costs. This paper introduces RAPID, a new programming framework and methodology for service-based applications with approximations and redundancies. Finding the best service configuration under a given resource budget becomes a constrained, dual-weight graph optimization problem.
Transactional Memory (TM) is a new programming paradigm that offers an alternative to traditional lock-based concurrency mechanisms. It offers a higher-level programming interface and promises to greatly simplify the ...
详细信息
ISBN:
(纸本)9780769543284
Transactional Memory (TM) is a new programming paradigm that offers an alternative to traditional lock-based concurrency mechanisms. It offers a higher-level programming interface and promises to greatly simplify the development of correct concurrent applications on multicore architectures. However, simplicity often comes with an important performance deterioration and given the variety of TM implementations it is still a challenge to know what kind of applications can really take advantage of TM. In order to gain some insight on these issues, helping developers to understand and improve the performance of TM applications, we propose a generic approach for collecting and tracing relevant information about transactions. Our solution can be applied to different Software Transactional Memory (STM) libraries and applications as it does not modify neither the target application nor the STM library source codes. We show that the collected information can be helpful in order to comprehend the performance of TM applications.
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.
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.
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.
暂无评论