In this paper, we present an object-oriented design of a software system called NETMAN to experiment distributed algorithms on a large network of workstations. the design has been structured into three layers and a ce...
详细信息
ISBN:
(纸本)0818685794
In this paper, we present an object-oriented design of a software system called NETMAN to experiment distributed algorithms on a large network of workstations. the design has been structured into three layers and a central monitoring site. We have implemented the system in Java. Two asynchronous-communication primitives, SEND and RECEIVE, have been implemented using Java's remote method invocation mechanism. As an example, we executed a distributed mutual exclusion algorithm on a network: of 60 work-stations, and measured its performance under various scenarios.
the parallel implementation of the revised simplex algorithm (RSA) using eta-factorization holds the promise of significant improvement in the execution time by virtue of the existence of a high degree of parallelism ...
详细信息
Withthe increasingly widespread adoption of cloud computing and tenants growing needs for large-scale data processing, cluster scheduling frameworks (e.g. MapReduce, Spark, etc.) have emerged as important programming...
详细信息
ISBN:
(纸本)9781479989379
Withthe increasingly widespread adoption of cloud computing and tenants growing needs for large-scale data processing, cluster scheduling frameworks (e.g. MapReduce, Spark, etc.) have emerged as important programming models that works for distributed and parallelcomputing on cloud systems. While several recent researches proposed some solutions to optimize the MapReduce-like scheduler, they hardly consider the significant impact of external factors caused by heterogeneity of cloud systems, especially I/O contention and instance types selection. In this paper, we present a simplified abstraction of cluster scheduling problem and formulate it as an optimization problem. To minimize the overall task weighted completion times, which is NP-complete, we propose a novel 7-approximation heuristic algorithm MRS. By comparing our algorithm with other classical scheduling strategies on Amazon EC2, we demonstrates that MRS consistently outperforms these algorithms under different scenarios.
this paper describes an approach for conformance testing of mobile and distributed systems. the approach is based on kiltera - a novel, high-level language supporting the description and execution of models of concurr...
详细信息
ISBN:
(纸本)9781605586557
this paper describes an approach for conformance testing of mobile and distributed systems. the approach is based on kiltera - a novel, high-level language supporting the description and execution of models of concurrent, mobile, distributed, and timed computation. In our approach, a kiltera model of the system is constructed from a high-level model which describes system behavior using, e.g., a suitable UML profile. Check points are identified in the implementation under test (IUT) and the kiltera model and both are instrumented appropriately at these check points. During execution, relevant information flows from the IUT to the kiltera model which signals any non-conformance detected. Unique features of our approach include the support for mobility, distribution, time, dynamic creation and deletion of agents, and distributed monitoring. We describe the approach and a prototype implementation using a running example for illustration. Results of first, preliminary experiments are reported. Copyright 2009 ACM.
We develop a consistent mutable replication extension for NFSv4 tuned to meet the rigorous demands of largescale data sharing in global collaborations. the system uses a hierarchical replication control protocol that ...
详细信息
ISBN:
(纸本)9780769528335
We develop a consistent mutable replication extension for NFSv4 tuned to meet the rigorous demands of largescale data sharing in global collaborations. the system uses a hierarchical replication control protocol that dynamically elects a primary server at various granularities. Experimental evaluation indicates a substantial performance advantage over a single server system. Withthe introduction of the hierarchical replication control, the overhead of replication is negligible even when applications mostly write and replication servers are widely distributed.
this papers shows how the state of the art in high-performance computing job scheduling can be augmented to provide not only best-effort based services or, at best, trivial quality of service parameters, but different...
详细信息
ISBN:
(纸本)9781905088423
this papers shows how the state of the art in high-performance computing job scheduling can be augmented to provide not only best-effort based services or, at best, trivial quality of service parameters, but differentiated service levels. A solution is proposed using long-term service level agreements (SLAs), in contrast to per-job SLAs that are normally used. An architecture for the the implementation of SLA-based job scheduling is presented and a workload trace, enhanced with service level data, is simulated in order to analyze the impact of service levels on key functions.
the accelerating growth of modern distributed applications with low delivery deadlines leads to a paradigm shift towards the multi-tier computing continuum. However, the geographical dispersion, heterogeneity, and ava...
详细信息
ISBN:
(纸本)9798350337662
the accelerating growth of modern distributed applications with low delivery deadlines leads to a paradigm shift towards the multi-tier computing continuum. However, the geographical dispersion, heterogeneity, and availability of the continuum resources may result in failures and quality of service degradation, significantly negating its advantages and lowering users' satisfaction. We propose in this paper a proactive application placement (PROS) method relying on distributed coordination to prevent the quality of service violations through service-level agreements on the computing continuum. PROS employs a sigmoid function with adaptive weights for the different parameters to predict the service level agreement assurance of devices based on their past credentials and current capabilities. We evaluate PROS using two application workloads with different traffic stress levels up to 90 million services on a real testbed with 600 heterogeneous instances deployed over eight geographical locations. the results show that PROS increases the success rate by 7%-33%, reduces the response time by 16%-38%, and increases the deadline satisfaction rate by 19%42% compared to two related work methods. A comprehensive simulation study with 1000 devices and a workload of up to 670 million services confirm the scalability of the results.
the current practice in grid programming uses message passing, which unfortunately leads to code that is difficult to understand, debug and optimize. Hence, for grids to become commonly accepted, also as general-purpo...
详细信息
ISBN:
(纸本)3540290672
the current practice in grid programming uses message passing, which unfortunately leads to code that is difficult to understand, debug and optimize. Hence, for grids to become commonly accepted, also as general-purpose parallel computation platforms, Suitable parallel programming environments need to be developed. In this paper we propose an approach to realize a distributed shared memory programming environment for computational grids called GridNestStep, by adopting NestStep, a structured parallel programming language based on the Bulk Synchronous parallel model of parallel computation.
Scalability and performance are crucial for simulations as much as accuracy is. Due to the limited availability and access to the variety of resources, cloud and MapReduce solutions are often evaluated on simulator pl...
详细信息
ISBN:
(纸本)9781479978816
Scalability and performance are crucial for simulations as much as accuracy is. Due to the limited availability and access to the variety of resources, cloud and MapReduce solutions are often evaluated on simulator platforms. As the complexity of the architectures and algorithms keep increasing, simulations themselves become large and resource-hungry. Simulators can be designed to be adaptive, exploiting the clusters and data-grid platforms. this paper describes the research for the design, development, and evaluation of a complete fully parallel and distributed cloud and MapReduce simulator (Cloud(2)Sim), leveraging the Java in-memory data grid platforms. Cloud(2)Sim provides a concurrent and distributed cloud simulator, by extending CloudSim cloud simulator, using Hazelcast in-memory key-value store. It also provides an assessment of the MapReduce implementations of Hazelcast and Infinispan, with means of simulating MapReduce executions. Cloud(2)Sim scales out the cloud and MapReduce simulations to multiple nodes running Hazelcast and Infinispan, based on load. the distributed execution model and adaptive scaling solution could further be leveraged as a general purpose auto-scaler middleware for a multi-tenanted deployment.
Skyline queries have played an increasingly important role in many applications such as web mining, multi-preference analysis and decision making. Most existing studies mainly focus on centralized systems, and skyline...
详细信息
ISBN:
(纸本)9781467302395
Skyline queries have played an increasingly important role in many applications such as web mining, multi-preference analysis and decision making. Most existing studies mainly focus on centralized systems, and skyline query processing in distributed environments is still an emerging and challenging topic. In this paper we propose SkyStorm, a delay-bounded skyline computing approach by exploiting the topology property of distributed hash tables (DHT). the effectiveness of our proposals is demonstrated through analysis and simulations.
暂无评论