Notice of Violation of ieee Publication Principles "Efficient Implementation of QRD-RLS Algorithm using Hardware-Software Co-design" by Napur Lodha, Nivesh Rai, Aarthy Krishnamurthy, Hrishikesh Venkataraman ...
Notice of Violation of ieee Publication Principles "Efficient Implementation of QRD-RLS Algorithm using Hardware-Software Co-design" by Napur Lodha, Nivesh Rai, Aarthy Krishnamurthy, Hrishikesh Venkataraman in the 2009 ieee International symposium on parallel & distributedprocessing (IPDPS 2009), 2009, pp. 1 - 4. After careful and considered review of the content and authorship of this paper by a duly constituted expert committee, this paper has been found to be in violation of ieee's Publication Principles. This paper contains significant portions of original text from the paper cited below. The original text was reused with insufficient attribution (including appropriate references to the original author(s) and/or paper title) and without permission from all coauthors. Due to the nature of this violation, reasonable effort should be made to remove all past references to this paper, and future references should be made to the following article: "Hardware-Software Co-design of QRD-RLS Algorithm with Microblaze Soft Core Processor" by Napur Lodha, Nivesh Rai, Rahul Dubey, Hrishikesh Venkataraman in the third International Conference on Information Systems, Technology and Management (ICISTM-09), 2009, pp. 197 - 207. This paper presents the implementation of QR Decomposition based Recursive Least Square (QRD-RLS) algorithm on Field Programmable Gate Arrays (FPGA) using hardware-software co-design. The system has been implemented on Xilinx Spartan 3E FPGA with Microblaze soft core processor. The hardware part consists of a custom peripheral that solves the part of the algorithm with higher computational costs and the software part consists of an embedded soft core processor that manages the control functions and rest of the algorithm. The speed and flexibility of FPGAs render them viable for such computationally intensive application. This paper also presents the implementation results and their analysis.
Provides an abstract of the keynote presentation and a brief professional biography of the presenter. The complete presentation was not made available for publication as part of the conference proceedings.
Provides an abstract of the keynote presentation and a brief professional biography of the presenter. The complete presentation was not made available for publication as part of the conference proceedings.
Integrating mobility into WSNs can significantly reduce the energy consumption of sensor nodes. However, this may lead to unacceptable data collection latency at the same time. In our previous work, we alleviated the ...
详细信息
Integrating mobility into WSNs can significantly reduce the energy consumption of sensor nodes. However, this may lead to unacceptable data collection latency at the same time. In our previous work, we alleviated the problem under the assumption of a mobile base station (BS). In this paper, we discuss how the problem can be solved when the BS itself is not capable of moving, but it can instead employ some mobile elements (MEs). The data collection latency is mainly determined by the longest tour of the MEs in this case. Each ME should be assigned a similar workload to reduce the latency. Furthermore, the total length of the tours should be minimized to decrease the working cost of MEs. We propose three methods to solve the problem with these two-fold objectives. In the first two methods, we cluster the network according to some criteria, and then construct the data collection tour for each ME. We apply a heuristic operator based on the genetic algorithm in the third method, whose fitness function is defined according to the two-fold objectives. These methods are evaluated by comprehensive experiments. The results show that the genetic method can provide us more steady solutions in term of data collection latency. We also compare the mobile BS model and the multiple MEs model, whose results show that the latter can get us better solutions when the number of MEs gets larger.
In view of the problems of centralized search engine and based on analyzing the technology of topic map, OAI, mobile Agent and P2P, we design and implement a Scalable distributed Retrieval Model based on Topic Map and...
详细信息
ISBN:
(纸本)9781424425105
In view of the problems of centralized search engine and based on analyzing the technology of topic map, OAI, mobile Agent and P2P, we design and implement a Scalable distributed Retrieval Model based on Topic Map and Mobile Agent. The model can effectively improve the utilization rate of resources, increase search depth, overcome server failure and heterogeneity of network, and has a strong capacity for expansion, fault-tolerant and parallelprocessing
This paper addresses the challenge of how to permit lightly coupled parallel applications, optimised for uniform, stable, static environments, execute equally efficiently in environments which exhibit the complete opp...
详细信息
ISBN:
(纸本)9780769534718
This paper addresses the challenge of how to permit lightly coupled parallel applications, optimised for uniform, stable, static environments, execute equally efficiently in environments which exhibit the complete opposite characteristics. Using the N-body problem as a case study, both the traditional and proposed grid enabled MPI implementations of the popular ring algorithm are analysed Results with respect to performance show the latter approach to be competitive on a cluster and significantly more effective in heterogeneous and dynamic environments.
TinyOS [1] is the current state of the art in operating systems for sensor network research. Event-based programming model of TinyOS presents concept of Task to allow postponing processing. For little processing and m...
详细信息
ISBN:
(纸本)9780769534718
TinyOS [1] is the current state of the art in operating systems for sensor network research. Event-based programming model of TinyOS presents concept of Task to allow postponing processing. For little processing and memory overhead and to avoid race conditions, tasks are non-preemptive. This causes executing long running task reduce system responsiveness. In general two approaches suggested for solving this problem: cooperative and multithreaded multitasking. In this paper we propose a new TinyOS task scheduler to integrate these approaches with new type of tasks. We argue that this approach improves the overall system responsiveness without concerning about data races or complicate programming for developers.
A b-coloring of a graph G is a proper coloring of the nodes of G such that each color class contains a node that has a neighbor in all other color classes. A fully dynamic algorithm is an algorithm used to support mod...
详细信息
ISBN:
(纸本)9780769534718
A b-coloring of a graph G is a proper coloring of the nodes of G such that each color class contains a node that has a neighbor in all other color classes. A fully dynamic algorithm is an algorithm used to support modifications (insertion or deletion) of nodes and edges in a network. Thus, in this paper we propose a fully dynamic distributed algorithm to maintain a b-coloring of a graph when its topology evolves. This method determines a b-coloring in time O(Delta(2)) and needs O(n Delta) changes of colors to maintain a b-coloring of a graph, where n is the number of nodes and A is the maximum degree in the graph.
In this paper, we describe an extension to the A CGT GridR environment which allows the parallelization of loops in R scripts in view of their distributed execution on a computational grid. The ACGT GridR service is e...
详细信息
ISBN:
(纸本)9780769534718
In this paper, we describe an extension to the A CGT GridR environment which allows the parallelization of loops in R scripts in view of their distributed execution on a computational grid. The ACGT GridR service is extended by a component that uses a set of preprocessor-like directives to organize and distribute calculations. The use of parallelization directives as special R comments provides users with the potential to accelerate lengthy calculations with changes to preexisting code. The GridR service and its extension are developed as components of the ACGT platform, one aim of which is to facilitate the data mining of clinical trials involving large datasets. In A CGT, GridR scripts are executed in the framework of a specifically developed workflow environment, which is also briefly outlined in the present article.
Much has been said about processing efficiently data in parallel database servers, and some data warehouse applications must process in the order of tens to hundreds of Gigabytes efficiently. Yet, there is no effectiv...
详细信息
ISBN:
(纸本)9780769534718
Much has been said about processing efficiently data in parallel database servers, and some data warehouse applications must process in the order of tens to hundreds of Gigabytes efficiently. Yet, there is no effective approach targeted at using non-dedicated low-cost plaforms efficiently in this context. Imagine taking together 10 or 1000 commodity PCs and setting-up a data crunching platform for large database-resident data with acceptable performance. There are significant inter-related data layout and processing challenges when the computational, storage and network hardware are heterogeneous and slow. We propose how to place, replicate and load-balance the data efficiently in this context. This work innovates in several respects: being practically as fast as full-mirroring without its overhead, exploring schema, chunk-wise placement, replication and load-balanced processing to be faster and more flexible than previous efforts. Our findings are complemented by an evaluation using TPC-H performance benchmark queries.
Current virtual server-based load balancing schemes for DHT have been shown to be able to achieve excellent load balancing effectiveness. However they face two important issues. They suffer from problems of incurring ...
详细信息
ISBN:
(纸本)9780769534718
Current virtual server-based load balancing schemes for DHT have been shown to be able to achieve excellent load balancing effectiveness. However they face two important issues. They suffer from problems of incurring extremely high overheads, and inducing severe inconsistency in DHT routing state. We present two fundamental components, virtual server management and active stabilization, whose inclusion into these schemes essentially eliminates these problems. As a result, these schemes not only incur overheads comparable to non-virtual server-based systems, but also achieve better query performance.
暂无评论