Using the multilevel concatenation, long block codes can be constructed from shorter component codes, resulting in much less decoding complexity. the component codes can also be constructed from multilevel concatenati...
详细信息
Mobile Edge computing (MEC) has been envisioned as a promising distributedcomputing paradigm, where mobile users offload their tasks to edge nodes to decrease the cost of energy and computation. However, most existin...
详细信息
ISBN:
(纸本)9781665449359
Mobile Edge computing (MEC) has been envisioned as a promising distributedcomputing paradigm, where mobile users offload their tasks to edge nodes to decrease the cost of energy and computation. However, most existing works only consider the congestion of wireless channels as the crucial factor influencing the strategy-making process, and ignore the impact of the offloading among edge nodes. In addition, centralized task offloading strategies result in heavy computation complexity in center nodes. Along this line, we take boththe congestion of wireless channels and the offloading among multiple edge nodes into consideration to enrich users' offloading strategies. To this end, we first formulate the offloading problem as a multi-user potential game, and then propose a distributed task offloading algorithm to reach an equilibrium state which can also protect individual privacy. Specifically, in the above task offloading algorithm, we propose two subalgorithms to select users for updating strategies: parallel User Selection Algorithm (PUS) and Single User Selection Algorithm (SUS) in order to substantially accelerate the convergence. Extensive experiments on three real-world data sets validate that the proposed algorithm achieves a Nash equilibrium and effectively decreases the total user cost which is acceptable compared to the optimal solution.
this paper presents the specification and implementation procedure using a microcomputer network based autonomous distributed control architecture for industrial multirobot systems. the procedure is based on the conce...
详细信息
this paper presents the specification and implementation procedure using a microcomputer network based autonomous distributed control architecture for industrial multirobot systems. the procedure is based on the concept of data flow network controlled by communicating sequential processes to perform coordinated tasks. Robots and other computerized industrial devices such as conveyors and manufacturing machines are defined as object-oriented Petri nets. A modular and hierarchical approach is adopted to define a set of Petri net type diagrams which represent concurrent activities of control processes for such devices. Asynchronous and synchronous interactions are modelled by places and transitions, respectively, in global process interaction nets. the control software is implemented on a computer network using Inmos transputers with true parallel processing and message passing primitives efficiently handled in hardware. Petri net based models are directly and efficiently transformed to corresponding codes in occam, the high level parallel. programming language defined for the transputer.
It is often required to conduct data mining among several sites to discover valuable patterns, associations, trends, and dependencies in the shared data. the privacy, however, is a concern. In many situations users do...
详细信息
It is often required to conduct data mining among several sites to discover valuable patterns, associations, trends, and dependencies in the shared data. the privacy, however, is a concern. In many situations users do require that data mining is conducted with no privacy of any site being leaked out to any other sites. In this paper a distributed privacy-preserving data mining algorithm is proposed, which is characterized with its ability to resist the collusion, and especially, a system with more sites tends to have the ability to resist more collusion. Performance analysis results are provided for demonstrating the effectiveness of the proposed algorithm.
distributed storage systems are increasing being used by data-intensive applications for efficient and reliable data delivery. the Network Storage Manager (NSM) is a distributed storage framework with a unique archite...
详细信息
distributed storage systems are increasing being used by data-intensive applications for efficient and reliable data delivery. the Network Storage Manager (NSM) is a distributed storage framework with a unique architecture that maximizes applications control over many of the storage and retrieval policies. Several applications are utilizing NSM for efficient, tunable, and controllable performance. Data layout is one policy that is considered to be application-dependant and tailored algorithms are preferred for application with complex or irregular access patters. Experimental results have shown dramatic performance enhancement when optimized layout policies override the default NSM implementation. Layout algorithms are more effective when proper prefetching and cache replacement policies are implemented.
the Web has proved to be very efficient and effective in delivering business data to users everywhere. Using the Web to deliver business applications has been more challenging due to the limitations of connection perf...
详细信息
the Web has proved to be very efficient and effective in delivering business data to users everywhere. Using the Web to deliver business applications has been more challenging due to the limitations of connection performance and client interface capabilities. We present a new distributed architecture for developing network enterprise applications with highly interactive rich client interfaces that can be deployed effectively on the Internet. the components are executed on the server side, eliminates the need and delay for transporting application code over the network as well as the serious security issues associated with executing downloaded programs on client machines. the new architecture also provides an ideal solution for enabling convenient remote access to network-enabled devices from anywhere.
this paper identifies the need for multiple clients to concurrently access a device community. A set of embedded devices cooperate via one or more service discovery protocols, such as UPnP, Jini, HAVi or OSGi. We pres...
详细信息
this paper identifies the need for multiple clients to concurrently access a device community. A set of embedded devices cooperate via one or more service discovery protocols, such as UPnP, Jini, HAVi or OSGi. We present an approach that encapsulates additional services into a distributed Access Framework (DAF). the services in DAF are responsible for secure and coordinated access of the distributed devices in the community. the different services of DAF can optionally be implemented and executed on different devices. We specify the DAF and demonstrate an implementation where the devices are organized according to the OSGi specification.
In the grid environment, applications make use of shared grid resources to improve performance. the target function usually depends on many parameters, e.g., the scheduling strategies, the configurations of machines a...
详细信息
In the grid environment, applications make use of shared grid resources to improve performance. the target function usually depends on many parameters, e.g., the scheduling strategies, the configurations of machines and links, the workloads in a grid, the degree of data replication, etc. In this paper, we examine how those parameters may affect performance. We choose an application's overall response time as an object function and focus on dynamically scheduling independent tasks. We define the job, scheduler and cost models and conduct experiments using simulations. Understanding influence of each parameter is not only crucial for an application to achieve good performance, but may also help to develop effective scheduling heuristics and design high quality grids.
Both web services framework and peer-to-peer networks provide a discovery process, but as current P2P systems focus more on the discovery of content in the form of common files (possibly associated with metadata), a c...
详细信息
ISBN:
(纸本)9780889867048
Both web services framework and peer-to-peer networks provide a discovery process, but as current P2P systems focus more on the discovery of content in the form of common files (possibly associated with metadata), a centralized UDDI registry serves content in the form of metadata describing web services. thus, the intersection between P2P and Web services is clear, so that it recently gained lots of interest: there is the need of finding a way to exploit the high potential of web services without paying in terms of scalability or single-point-of-failures. Our aim in this paper is two-fold: on the one hand, we want to present a high level protocol for the addressing and the discovery of web services that is totally decentralized and based on a structured P2P topology. On the other hand, we introduce a way to solve the exact match key-based routing problem, that afflicts structured P2P systems. this model guarantees that all addressed web services will be discovered in a logarithmic number of hops, as it is based on a distributed Hash Table. One of the key innovation is the possibility of customizing the categorization of web services using tags, which are becoming very common in the so called Web 2.0.
the EU-funded XtreemOS project implements a Linux-based grid operating system (OS), exploiting resources of virtual organizations through the standard POSIX interface. the Object Sharing Service (OSS) of XtreemOS addr...
详细信息
ISBN:
(纸本)9780889867741
the EU-funded XtreemOS project implements a Linux-based grid operating system (OS), exploiting resources of virtual organizations through the standard POSIX interface. the Object Sharing Service (OSS) of XtreemOS addresses the challenges of transparent data sharing for distributed applications running in grids. We focus on the problem of handling consistency of replicated data in wide area networks in the presence of failures. the software architecture we propose interweaves concepts from transactional memory and peer-to-peer systems. Speculative transactions relieve programmers from complicated lock management. Super-peer-based overlay networks improve scalability and distributed hash tables speed up data search. OSS replicates objects to improve reliability and performance. In case of severe faults, the XtreemOS grid checkpointing service will support OSS. In this paper we describe the software architecture of OSS, design decisions, and evaluation results of preliminary experiments with a multi-user 3D virtual world.
暂无评论