An important challenge facing e-Science is the development of scalable systems and analysis techniques that allow client applications to locate data and services in increasingly large-scale distributed environments. e...
详细信息
Class prediction of a protein facilitates to enhance the process of drug discovery. In drug discovery, it is very problematic to find out the complementary protein for each protein individually. But if the class of th...
详细信息
Many application domains including graph analytics, the Internet-of-Things, precision agriculture, and media processing operate on noisy data and/or produce approximate results. These applications can distribute compu...
详细信息
ISBN:
(纸本)9783030884949;9783030884932
Many application domains including graph analytics, the Internet-of-Things, precision agriculture, and media processing operate on noisy data and/or produce approximate results. These applications can distribute computation across multiple (often resource-constrained) processing units. Analyzing the reliability and accuracy of such applications is challenging, since most existing techniques operate on specific fixed error models, check for individual properties, or can only be applied to sequential programs. We present Diamont, a system for dynamic monitoring of uncertainty properties in distributed programs. Diamont programs consist of distributed processes that communicate via asynchronous message passing. Diamont includes datatypes that dynamically monitor uncertainty in data and provides support for checking predicates over the monitored uncertainty at runtime. We also present a general methodology for verifying the soundness of the runtime system and optimizations using canonical sequentialization. We implemented Diamont for a subset of the Go language and evaluated eight programs from precision agriculture, graph analytics, and media processing. We show that Diamont can prove important end-to-end properties on the program outputs for significantly larger inputs compared to prior work, with modest execution time overhead: 3% on average and 16.3% at maximum.
This book constitutes the refereed proceedings of the 20th internationalconference on parallel and distributed Computing, Euro-Par 2014, held in Porto, Portugal, in August 2014. The 68 revised full papers presented w...
详细信息
ISBN:
(数字)9783319098739
ISBN:
(纸本)9783319098722
This book constitutes the refereed proceedings of the 20th internationalconference on parallel and distributed Computing, Euro-Par 2014, held in Porto, Portugal, in August 2014. The 68 revised full papers presented were carefully reviewed and selected from 267 submissions. The papers are organized in 15 topical sections: support tools environments; performance prediction and evaluation; scheduling and load balancing; high-performance architectures and compilers; parallel and distributed data management; grid, cluster and cloud computing; green high performance computing; distributed systems and algorithms; parallel and distributed programming; parallel numerical algorithms; multicore and manycore programming; theory and algorithms for parallel computation; high performance networks and communication; high performance and scientific applications; and GPU and accelerator computing.
Scientific computing applications with highly demanding data capacity and computation power drive a computing platform migration from shared memory machines to multi-core/multiprocessor computer clusters. However, ove...
详细信息
ISBN:
(纸本)9783540680819
Scientific computing applications with highly demanding data capacity and computation power drive a computing platform migration from shared memory machines to multi-core/multiprocessor computer clusters. However, overheads in coordinating operations across computing nodes could counteract the benefit of having extra machines. Furthermore, the hidden dependency in applications slows down the simulation over non-shared memory machines. This paper proposed a framework to utilize multi-core/multiprocessor clusters for distributed simulation. Among several coordination schemes, decentralized control approach has demonstrated its effectiveness in reducing the communication overheads. A speculative execution strategy is applied to exploit parallelism thoroughly and overcome strong data dependency. Performance analysis and experiments are provided to demonstrate the performance gains.
The improvement of a new changed algorithms for virtual photograph sampling and quantization in serial and parallel image processing is proposed. The set of rules improves upon existing methods with the aid of combini...
详细信息
In the traditional consensus problem (aka Byzantine agreement), parties are required to agree on a common value despite the malicious behavior of some of them, subject to the condition that if all the honest parties s...
详细信息
ISBN:
(纸本)9783031587337;9783031587344
In the traditional consensus problem (aka Byzantine agreement), parties are required to agree on a common value despite the malicious behavior of some of them, subject to the condition that if all the honest parties start the execution with the same value, then that should be the outcome. This problem has been extensively studied by both the distributed computing and cryptographic protocols communities. With the advent of blockchains, whose main application-a distributed ledger-essentially requires that miners agree on their views, new techniques have been proposed to solve the problem, and in particular in so-called "permissionless" environments, where parties are not authenticated or have access to point-to-point channels and, further, may come and go as they please. So far, the fastest way to achieve consensus in the proof-of-work (PoW)-based setting of Bitcoin, takes O(polylog.) number of rounds, where. is the security parameter. We present the first protocol in this setting that requires expected-constant number of rounds. Furthermore, we show how to apply securely sequential composition in order to yield a fast distributed ledger protocol that settles all transactions in expected-constant time. Our result is based on a novel instantiation of " m-for-1 PoWs" on parallel chains that facilitates our basic building block, Chain-King Consensus. The techniques we use, via parallel chains, to port classical protocol design elements (such as Phase-King Consensus, super-phase sequential composition and others) into the permissionless setting may be of independent interest.
This paper presents the managing of large-scale distributed system with the use of mobile agent concept in distributed environment which is becoming an increasing challenging task. The primary goal is to ensure effici...
详细信息
ISBN:
(纸本)9788132212980;9788132212997
This paper presents the managing of large-scale distributed system with the use of mobile agent concept in distributed environment which is becoming an increasing challenging task. The primary goal is to ensure efficient use of resources, services of computer systems, and networks to provide timely services to the end users using mobile agent with decentralized processing and control in distributed resources so as to minimize the network traffic and speed up management tasks in distributed environment, provide more scalability, and to provide more flexibility in the development and maintenance of the applications. The problem with the traditional techniques is, when the number of visited nodes grows, the mobile agent size also increases and making migration harder. One possible solution to this problem is to visit a fixed number of nodes, return to the agent home or send all data to it (reducing the mobile agent size), and start the task again on the remaining nodes. The initial size of a mobile agent also affects agent performance, since the larger the size, the more difficult the migration.
We have developed reliable web applications based on the web services technology on J2EE and .NET. Web applications implemented using web services are platform and language independent. The web services are available ...
详细信息
Over the past two years, the COVID-19 pandemic has been one of the most frequently and hotly debated social topics. Lockdowns and restrictions radically change the way of working and socializing due to social distanci...
详细信息
暂无评论