Full-duplex (FD) has been considered as a promising technology to significantly improve the spectrum efficiency in 5G networks. Considering the current self-interference cancellation (SIC) techniques, full-duplex is m...
详细信息
ISBN:
(纸本)9781538637906
Full-duplex (FD) has been considered as a promising technology to significantly improve the spectrum efficiency in 5G networks. Considering the current self-interference cancellation (SIC) techniques, full-duplex is more suitable for device-to-device (D2D) and small cell communications which have small transmission range and low transmit power. However, the interference induced by full-duplex could reduce the performance gain, especially in high density multi-tier HetNets. Naturally, the performance analysis of full-duplex D2D communications in such environment is required. In this work, we present a tractable analytical model based on stochastic geometry. Specifically, the coverage probability and spectrum efficiency of D2D operations in different modes are analyzed considering both perfect SIC and imperfect SIC. And analytical expressions are obtained which are further evaluated by extensive simulations. The results indicate that in high-dense multi-tier HetNets, the increasing number of users transmitting in FD-D2D mode could impair the entire network throughput due to the interference incurred. However, with appropriate choice of proportions of users in different transmission modes, the performance gain of full-duplex D2D communications can be achieved. The results obtained can be helpful for optimal network deployment and operations.
parallelapplications executing on large system size of parallel systems achieve better speedup than on small system size. However, because of the design and implementation of the distributed Shared Memory (DSM) syste...
详细信息
ISBN:
(纸本)0769510779
parallelapplications executing on large system size of parallel systems achieve better speedup than on small system size. However, because of the design and implementation of the distributed Shared Memory (DSM) system, there are some instances that large system size has no further performance improvement over small system size. It is important to determine what system size will result in the maximum speedup while all kinds of applications are running on DSM systems. In this paper rte describe rite design and implementation of we performance prediction mechanism ill our DSM system, Proteus [13], which supports node reconfiguration to adjust system size at runtime. We adopt a simple computation model and combine it with runtime information to predict the performance under different system sizes. With this work, it is possible to provide timely prediction result for the underlying system to adjust system size and thus maximize speedup.
distributed publish/subscribe middleware insures the necessary decoupling, expressiveness, and scalability for modern distributedapplications. Unfortunately, the performance of this middleware is usually degraded in ...
详细信息
ISBN:
(纸本)9781509060580
distributed publish/subscribe middleware insures the necessary decoupling, expressiveness, and scalability for modern distributedapplications. Unfortunately, the performance of this middleware is usually degraded in the presence of highly mobile scenarios. In this paper, we tackle the problem of mobility in publish/subscribe by exploiting a predictive scheme. We investigate the adequacy of our approach using a prototype implementation with respect to different scenarios. The experimental results show that our approach reduces the caching cost, the propagation cost and the network load. It also achieves better results in terms of overhead.
The traditional distributed simulations are small-scale and individual, but the today's distributed simulations are large-scale and complex. Therefore the complex distributed simulations require significant advanc...
详细信息
ISBN:
(纸本)1892512416
The traditional distributed simulations are small-scale and individual, but the today's distributed simulations are large-scale and complex. Therefore the complex distributed simulations require significant advances both in the underlying network technologies and in the ability of simulations to exploit new networking capabilities such as flexibility, reusability interoperability, performance, and scalability. This paper first describes a study to design for a chemical contamination diffusion model (CCD Model) that a potential model developing based on HLA (High Level Architecture). Next, discusses modifications that were made to the RTI (Run-Time Infrastructure), to the simulations that comprised the federation, and to the FOM (Federation Object Model) to incorporate these capabilities in the operation of the simulation. We had tested the ModCCD in order to estimating the effectiveness of it and we found that the ModCCD reduced network traffic. Our proposed model is more effective when federates (or federation) contain large numbers of entities having limited regions of interaction with each other under distributed environment.
Today, the task of running and coordinating a scientific application across several administrative domains is extremely complex. As an example, the most popular tool for scientific applications, MPI, is not designed t...
详细信息
ISBN:
(纸本)0769523811
Today, the task of running and coordinating a scientific application across several administrative domains is extremely complex. As an example, the most popular tool for scientific applications, MPI, is not designed to address firewall limitations or data heterogeneity, even if its extensions deal with some of these problems. In this paper, we design a new approach to run a scientific application in a distributed environment, when data and computing power are scattered across the Web: Web Services can be used to tunnel computation and data migration. We show that a very simple mapping exists between MPI primitives and the Web Service infrastructure. We are currently designing a framework, based on Web Services, which will implement the main MPI primitives: this way an MPI application could be run on any platform supporting Web Services.
Analysis of large geographically distributed scientific datasets, also referred to as distributed data-intensive science, has emerged as an important area in recent years. An application that processes data from a rem...
详细信息
ISBN:
(纸本)0769526365
Analysis of large geographically distributed scientific datasets, also referred to as distributed data-intensive science, has emerged as an important area in recent years. An application that processes data from a remote repository needs to be broken into several stages, including a data retrieval task at the data repository, a data movement task, and a data processing task at a computing site. Because of the volume of data that is involved and the amount of processing, it is desirable that both the data repository and computing site may be clusters. This can further complicate the development of such data processingapplications. In this paper, we present a middleware, FREERIDE-G (FRamework for Rapid Implementation of Datamining Engines in Grid), which support a high-level interface for developing data mining and scientific data processingapplications that involve data stored in remote repositories. Particularly, we had the following goals behind designing the FREERIDE-G middleware: 1) Support high-end processing, i.e., use parallel configurations for both hosting the data and processing the data, 2) Ease use of parallel configurations, i.e., support a high-level API for specifying the processing, and 3) Hide details of data movement and caching. We have evaluated our system using three popular data mining algorithms and two scientific data analysis applications. The main observations from our experiments are as follows. First, FREERIDE-G is able to scale the processing extremely well when the number of data server and compute nodes are scaled evenly. Second, when only the number of compute nodes are scaled, our target class of applications achieve modest additional speedups. Finally, for applications that involve multiple passes on the dataset, caching remote data provides significant improvement.
Component trees are powerful image processing tools to analyze the connected components of an image. One attractive strategy consists in building the nested relations at first and then deriving the components' att...
详细信息
ISBN:
(数字)9781665496209
ISBN:
(纸本)9781665496209
Component trees are powerful image processing tools to analyze the connected components of an image. One attractive strategy consists in building the nested relations at first and then deriving the components' attributes afterward, such that the user can switch between different attribute functions without having to re-compute the entire tree. Only sequential algorithms allow such an approach, while no parallel algorithm is available. In this paper, we extend a recent method using distributed memory techniques to enable posterior attribute computation in a parallel or distributed manner. This novel approach significantly reduces the computational time needed for combining several attribute functions interactively in Giga and Tera-Scale data sets.
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.
Some datasets and computing environments are inherently distributed. For example, image data may be gathered and stored at different locations. Although data parallelism is a well-known computational model, there are ...
详细信息
ISBN:
(纸本)0769521983
Some datasets and computing environments are inherently distributed. For example, image data may be gathered and stored at different locations. Although data parallelism is a well-known computational model, there are few programming systems that are both easy to program (for simple applications) and can work across administrative domains. We have designed and implemented a simple programming system, called Trellis-SDP, that facilitates the rapid development of data-intensive applications. Trellis-SDP is layered on top of the Trellis infrastructure, a software system for creating overlay metacomputers: user-level aggregations of computer systems. Trellis-SDP provides a master-worker programming framework where the worker components can run self-contained, new or existing binary applications. We describe two interface functions, namely trellis_scano() and trellis_gather(), and show how easy it is to get reasonable performance with simple data-parallelapplications, such as Content Based Image Retrieval (CBIR) and parallel Sorting by Regular Sampling (PSRS).
Streaming applications are often used for embedded and high-performance multi and manycore processors. Achieving high throughput without wasting energy can be achieved by static scheduling of parallelizable tasks with...
详细信息
ISBN:
(纸本)9781509060580
Streaming applications are often used for embedded and high-performance multi and manycore processors. Achieving high throughput without wasting energy can be achieved by static scheduling of parallelizable tasks with frequency scaling. We present asymmetric crown scheduling, which improves on the static crown scheduling approach by allowing flexible split ratios when subdividing processor groups. We formulate the scheduler as an integer linear program and evaluate it with synthetic task sets. The results demonstrate that a small number of split ratios improves energy efficiency of crown schedules by up to 12% with slightly higher scheduling time.
暂无评论