The signicant development of high-level synthesis tools has greatly facilitated FPGAs as general computing platforms. During the parallelism optimization for the data path, mem-ory becomes a crucial bottleneck that im...
详细信息
ISBN:
(纸本)9781450326711
The signicant development of high-level synthesis tools has greatly facilitated FPGAs as general computing platforms. During the parallelism optimization for the data path, mem-ory becomes a crucial bottleneck that impedes performance enhancement. Simultaneous data access is highly restricted by the data mapping strategy and memory port constraint. Memory partitioning can eciently map data elements in the same logical array onto multiple physical banks so that the accesses to the array are parallelized. Previous meth-ods for memory partitioning mainly focused on cyclic parti-tioning for single-port memory. In this work we propose a generalized memory-partitioning framework to provide high data throughput of on-chip memories. We generalize cyclic partitioning into block-cyclic partitioning for a larger de-sign space exploration. We build the conict detection algo-rithm on polytope emptiness testing, and use integer points counting in polytopes for intra-bank oset generation. Mem-ory partitioning for multi-port memory is supported in this framework. Experimental results demonstrate that com-pared to the state-of-art partitioning algorithm, our pro-posed algorithm can reduce the number of block RAM by 19.58%, slice by 20.26% and DSP by 50%.
Online social networks are gaining galloping upward momentum in a quick succession ever since from their inception as they lay a sturdy platform to share the information seeping into everyone who is concerned about it...
详细信息
Testing the inherited features is clearly essential, however, the testing process can easily become very complex if features in the child classes are unnecessarily tested. In this paper, an object-oriented testing tec...
详细信息
Testing the inherited features is clearly essential, however, the testing process can easily become very complex if features in the child classes are unnecessarily tested. In this paper, an object-oriented testing technique "Inheritance Testing in Classes" (ITC) is proposed that facilitates the testing of object-oriented code by incorporating procedures to support inheritance testing. ITC provides a framework that helps to ensure that appropriate components and interactions are tested by generating code segments that drive the testing process. ITC is developed and tested using the object-oriented (OO) paradigm.
We define an 2 -disparity measure between curved high-order meshes and parameterized manifolds in terms of an 2 norm. The main application of the proposed definition is to measure and improve the distance between a cu...
详细信息
We define an 2 -disparity measure between curved high-order meshes and parameterized manifolds in terms of an 2 norm. The main application of the proposed definition is to measure and improve the distance between a curved high-order mesh and a target parameterized curve or surface. The approach allows considering meshes with the nodes on top of the curve or surface (interpolative), or floating freely in the physical space (non-interpolative). To compute the disparity measure, the average of the squared point-wise differences is minimized in terms of the nodal coordinates of an auxiliary parametric high-order mesh. To improve the accuracy of approximating the target manifold with a non-interpolating curved high-order mesh, we minimize the square of the disparity measure expressed both in terms of the nodal coordinates of the physical and parametric curved high-order meshes. The proposed objective functions are continuously differentiable and thus, we are able to use minimization algorithms that require the first or the second derivatives of the objective function. Finally, we present several examples that show that the proposed methodology generates high-order approximations of the target manifold with optimal convergence rates for the geometric accuracy even when non-uniform parameterizations of the manifolds are prescribed. Accordingly, we can generate coarse curved high-order meshes significantly more accurate than finer low-order meshes that feature the same resolution.
Log Management has been an important service in Cloud Computing. In any business, maintaining the log records securely over a particular period of time is absolutely necessary for various reasons such as auditing, for...
详细信息
Wireless Sensor Networks (WSNs) have been utilized by many critical applications such as military and health care monitoring. Such applications require special Quality of Service (QoS) treatment. However, the componen...
详细信息
Wireless Sensor Networks (WSNs) have been utilized by many critical applications such as military and health care monitoring. Such applications require special Quality of Service (QoS) treatment. However, the components of sensor nodes suffer from different limitations including the scarce energy source, limited processing capabilities, and limited storage space. At the same time, nodes are supposed to live for long time. This could occur when the energy is balanced on the active nodes in the network. This paper handles the problem of QoS in Wireless Sensor Networks (WSNs). The paper considers the limitation of the nodes in handling many messages at the same time especially the sink node. Therefore, nodes can coordinate with each other to minimize the number of dropped message. Defining some nodes to send to the sink node at certain time allows other nodes to go to sleep. Certainly, this QoS control enhances the operation of the network and positively affect the nodes’ consumed energy. This work applies one of the game theory schemes which is Gur game. The paper proposes two QoS control techniques with Quick Convergence called Periodic Gur Game (PGur) and Adaptive Periodic Gur Game (APGur). These two approaches are evaluated using different sets of experiments.
MANET is a collection of wireless nodes with high mobility ratio. Construction of path is mandatory by the source node to its destination in-order to communicate. As the nodes move very fast, the path which had been c...
详细信息
MANET is a collection of wireless nodes with high mobility ratio. Construction of path is mandatory by the source node to its destination in-order to communicate. As the nodes move very fast, the path which had been constructed cannot persist. A path may or may not exist even immediate to its construction. Though many mobility models and routing protocols are in existence, finding such path is still a challenge for the mobile nodes in MANET environment. Frequent path failures are not appreciated for certain application as the communication is important and emergency. In this research work an algorithm named "Time Account Based Path Stabilizer (TABPS)" is used to improve the stability of the constructed path between a pair of source and destination.
A high-performance interconnection between a host processor and FPGA accelerators is in much demand. Among various interconnection methods, a PCIe bus is an attractive choice for loosely coupled accelerators. Because ...
详细信息
Recommending products to users means estimating their preferences for certain items over others. This can be cast either as a problem of estimating the rating that each user will give to each item, or as a problem of ...
详细信息
ISBN:
(纸本)9781450325981
Recommending products to users means estimating their preferences for certain items over others. This can be cast either as a problem of estimating the rating that each user will give to each item, or as a problem of estimating users' relative preferences in the form of a ranking. Although collaborative-filtering approaches can be used to identify users who rate and rank products similarly, another source of data that informs us about users' preferences is their set of social connections. Both rating- and ranking-based paradigms are important in real-world recommendation settings, though rankings are especially important in settings where explicit feedback in the form of a numerical rating may not be available. Although many existing works have studied how social connections can be used to build better models for rating prediction, few have used social connections as a means to derive more accurate ranking-based models. Using social connections to better estimate users' rankings of products is the task we consider in this paper. We develop a model, SBPR (Social Bayesian Personalized Ranking), based on the simple observation that users tend to assign higher ranks to items that their friends prefer. We perform experiments on four real-world recommendation data sets, and show that SBPR outperforms alternatives in ranking prediction both in warm- and cold-start settings. Copyright 2014 ACM.
In the last decade tremendous development in the area of mobile and wireless network. Internet engineering Task Force (IETF) proposed Mobile IPv6 to provide mobility in wireless IPv6 networks. But still transparent mo...
详细信息
In the last decade tremendous development in the area of mobile and wireless network. Internet engineering Task Force (IETF) proposed Mobile IPv6 to provide mobility in wireless IPv6 networks. But still transparent mobility over the Internet is one of the biggest in challenges. Recently Hierarchical Mobile IPv6 (HMIPv6) and Proxy Mobile IPv6 (PMIPv6) are proposed to reduce the handover latency and as a result to reduce packet loss. This paper analyzes impact of handover latency wireless link delay on handover latency and compares the results analytically.
暂无评论