Most IC's today are described and documented using hierarchical netlists. In addition to gates, latches, and flip-flops, these netlists include sliceable register-transfer components such as registers, counters, a...
详细信息
Most IC's today are described and documented using hierarchical netlists. In addition to gates, latches, and flip-flops, these netlists include sliceable register-transfer components such as registers, counters, adders, ALU's shifters, register files, and multiplexers. Usually, these components are decomposed into basic gates, latches, and flip-flops for layout with standard cells. The standard cell algorithms do not exploit the bit-sliced nature of register-transfer components, however. In this paper, we present a partitioning methodology that exploits the regularity of register-transfer components. We also describe partitioning algorithms that are used to generate the floor plan. The partitioning algorithms not only select the layout style best suited for each component, but also consider critical paths, I/O pin locations, and connections between components. This approach improves the overall area utilization and minimizes the wire length on the critical paths.
We address a generalized Voronoi partitioning problem for a team of mobile agents with nonlinear dynamics with respect to a state-dependent proximity metric. In particular, the proximity (pseudo-) metric corresponds t...
详细信息
We address a generalized Voronoi partitioning problem for a team of mobile agents with nonlinear dynamics with respect to a state-dependent proximity metric. In particular, the proximity (pseudo-) metric corresponds to the reduction of a generalized energy metric that occurs during the transfer of an agent to an arbitrary destination with zero terminal velocity, in finite time. The realization of every finite-time state transition takes place by means of a class of continuous feedback control laws that render the closed loop dynamics of each mobile agent non-Lipschitzian. The arrival time also turns out to be a state-dependent quantity, whose functional description is not prescribed a priori. We show that the partitioning problem studied in this work can admit a decentralized solution, that is, each agent can compute its own cell independently from its teammates provided that is aware of the positions and velocities of its neighboring agents. Numerical simulations that illustrate the theoretical developments are also presented. (C) 2015 Elsevier Ltd. All rights reserved.
The discrete phase-retrieval problem with disconnected support is to reconstruct a discrete-time signal whose support is the union of disjoint intervals from the magnitude of its discrete Fourier transform, We use the...
详细信息
The discrete phase-retrieval problem with disconnected support is to reconstruct a discrete-time signal whose support is the union of disjoint intervals from the magnitude of its discrete Fourier transform, We use the Good-Thomas FFT mapping to transform the one-dimensional (1-D) version of this problem into a two-dimensional (2-D) discrete phase retrieval problem, We then solve the latter problem by partitioning it into a set of 1-D phase-retrieval problems, The discrete and modulated Radon transforms are used to formulate two coupled 1-D problems, the solution to which specifies solutions to the other 1-D problems, This effectively partitions the original disconnected support 1-D problem into smaller 1-D problems, which may be solved in parallel, Small amounts of noise in the data can be rejected by using more than two coupled 1-D problems, The 2-D phase retrieval problem with disconnected support is also considered, Numerical examples are provided, including comparison with the hybrid I/O algorithm.
This paper is concerned with the development of distributed spatial partitioning algorithms for locational optimization problems involving networks of agents with planar rigid body dynamics subject to communication co...
详细信息
This paper is concerned with the development of distributed spatial partitioning algorithms for locational optimization problems involving networks of agents with planar rigid body dynamics subject to communication constraints. The domain of the problems we consider is a three-dimensional (3-D) nonflat manifold embedded in the state space of the agents, which we refer to as the terminal manifold. The approach we propose allows us to associate the partition of the 3-D terminal manifold, which is induced by a nonquadratic proximity metric and comprised of nonconvex cells, with a one-parameter family of partitions of 2-D flat manifolds, which are induced by (parametric) quadratic proximity metrics and comprised of convex polygonal cells. By exploiting the special structure of the parametric partitions, we develop distributed partitioning algorithms that converge in a finite number of steps. Subsequently, we utilize the solutions to the latter problems to solve a class of locational optimization problems over the terminal manifold. Numerical simulations that illustrate the capabilities of the proposed algorithms are also presented.
Modern energy detectors typically use adaptive threshold estimation algorithms to improve signal detection in cognitive radio-based industrial wireless sensor networks (CR-IWSNs). However, a number of adaptive thresho...
详细信息
Modern energy detectors typically use adaptive threshold estimation algorithms to improve signal detection in cognitive radio-based industrial wireless sensor networks (CR-IWSNs). However, a number of adaptive threshold estimation algorithms often perform poorly under noise uncertainty conditions since they are typically unable to auto-adapt their parameter values per changing spectra conditions. Consequently, in this paper, we have developed two new algorithms to accurately and autonomously estimate threshold values in CR-IWSNs under dynamic spectra conditions. The first algorithm is a parametric-based technique termed the histogram partitioning algorithm, whereas the second algorithm is a fully autonomous variant termed the mean-based histogram partitioning algorithm. We have evaluated and compared both algorithms with some well-known methods under different CR sensing conditions. Our findings indicate that both algorithms maintained over 90% probability of detection in both narrow and wideband sensing conditions and less than 10% probability of false alarm under noise-only conditions. Both algorithms are quick and highly scalable with a time complexity of O(V), where V is the total number of input samples. The simplicity, effectiveness, and viability of both algorithms make them typically suited for use in CR-IWSN applications.
Absorption coefficient partitioning algorithms (APAs) were developed to partition Absorption;the total absorption coefficient (a(lambda)) or total non-water absorption coefficient (a(nw)(lambda)) into the absorption s...
详细信息
Absorption coefficient partitioning algorithms (APAs) were developed to partition Absorption;the total absorption coefficient (a(lambda)) or total non-water absorption coefficient (a(nw)(lambda)) into the absorption subcomponents, i.e., absorption due to phytoplankton a(ph)(lambda), colored dissolved organic matter (CDOM) a(g)(lambda) and non-algal particulate matter a(d)(lambda), lambda. is the wavelength. Absorption coefficients of CDOM and non-algal particulate matter are generally combined due to a similarity in exhibited spectral shape and represented as colored detrital matter (CDM) absorption coefficient, a(dg)(lambda). This study focuses on the applicability of five APAs Schofield's, Lin's, Zhang's, Stacked Constraints Model (SCM) and Generalized Stacked Constraints Model (GSCM), in deriving the absorption subcomponents from a(nw)(lambda) in optically complex coastal waters of Kochi and Goa, India. The average spectral Mean Absolute Percentage Errors (MAPE) obtained for all models in the retrieval of a(ph)(lambda), a(d)(lambda), a(g)(lambda) and a(dg)(lambda) lie in the ranges of 26-44%, 37-45%, 34-65% and 42-56%. Slopes of a(dg)(lambda), a(g)(lambda) and a(d)(lambda) as indicated by S-dg, S-g and S-d are derivable from GSCM, Schofield and Lin's models only. GSCM model exhibited good retrieval capability of S-d with MAPE values of 22% and a correlation coefficient of 0.74. In retrieval of S-g parameter, none of the models demonstrated satisfactory performance. Overall, the GSCM and Schofield's models demonstrated good performance in the retrieval of absorption subcomponents, a(ph)(lambda), a(dg)(lambda), a(d)(lambda) and S-d. Effect of applying baseline correction to a(d)(lambda) on model performance is studied. Tuning with in situ data can further improve the absorption subcomponent and slope parameter retrieval capability of the models. (C) 2021 Institute of Oceanology of the Polish Academy of Sciences. Production and hosting by Elsevier B.V.
In the era of ubiquitous computing, applications are emerging to benefit from using devices of different users and different capabilities together. This paper focuses on user-centric web browsing using multiple device...
详细信息
In the era of ubiquitous computing, applications are emerging to benefit from using devices of different users and different capabilities together. This paper focuses on user-centric web browsing using multiple devices, where content of a web page is partitioned, adapted and allocated to devices in the vicinity. We contribute two novel web page partitioning algorithms. They differ from existing approaches by allowing for both, automatic and semi-automatic partitioning. On the one hand, this provides good automatic, web page independent results by utilizing sophisticated structural pre-and postprocessing of the web page. On the other hand, these results can be improved by considering additional semantic information provided through user-generated web page annotations. We further present a performance evaluation of our algorithms. Moreover, we contribute the results of a user study. These clearly show that (1) our algorithms provide good automatic results and (2) the application of user-centric, annotation-based semantic information leads to a significantly higher user satisfaction.
Symmetric features of the frieze group equivalent mappings were analysed, and two partitioning algorithms are given for constructing generalized Mandelbrot sets of frieze group equivalent mappings in order to study th...
详细信息
ISBN:
(纸本)9783037857519
Symmetric features of the frieze group equivalent mappings were analysed, and two partitioning algorithms are given for constructing generalized Mandelbrot sets of frieze group equivalent mappings in order to study the characteristics of generalized Msets. Based on generating parameter space of dynamical system, lots of patterns of generalized Mandelbrot sets are produced.
High-level programming languages have transformed graphics processing units (GPUs) from domain-restricted devices into powerful compute platforms. Yet many "general-purpose GPU" (GPGPU) applications fail to ...
详细信息
ISBN:
(纸本)9783981537024
High-level programming languages have transformed graphics processing units (GPUs) from domain-restricted devices into powerful compute platforms. Yet many "general-purpose GPU" (GPGPU) applications fail to fully utilize the GPU resources. Executing multiple applications simultaneously on different regions of the GPU (spatial multitasking) thus improves system performance. However, within-die process variations lead to significantly different maximum operating frequencies (F-max) of the streaming multiprocessors (SMs) within a GPU. As the chip size and number of SMs per chip increase, the frequency variation is also expected to increase, exacerbating the problem. The increased number of SMs also provides a unique opportunity: we can allocate resources to concurrently-executing applications based on how those applications are affected by the different available F-max values. In this paper, we study the effects of per-SM clocking on spatial multitasking-capable GPUs. We demonstrate two factors that affect the performance of simultaneously-running applications: (i) the SM partitioning algorithm that decides how many resources to assign to each application, and (ii) the assignment of SMs to applications based on the operating frequencies of those SMs and the applications characteristics. Our experimental results show that spatial multitasking that partitions SMs based on application characteristics, when combined with per-SM clocking, can greatly improve application performance by up to 46% on average compared to cooperative multitasking with global clocking.
In the field of scientific computing, load balancing is a major issue that determines the performance of parallel applications. Nowadays, simulations of real-life problems are becoming more and more complex, involving...
详细信息
ISBN:
(纸本)9781479959754
In the field of scientific computing, load balancing is a major issue that determines the performance of parallel applications. Nowadays, simulations of real-life problems are becoming more and more complex, involving numerous coupled codes, representing different models. In this context, reaching high performance can be a great challenge. In this paper, we present graph partitioning techniques, called co-partitioning, that address the problem of load balancing for two coupled codes: the key idea is to perform a "coupling-aware" partitioning, instead of partitioning these codes independently, as it is usually done. Finally, we present a preliminary experimental study which compares our methods against the usual approach.
暂无评论