Refine your search
Collections
Co-Authors
A B C D E F G H I J K L M N O P Q R S T U V W X Y Z All
Neelamegam, P.
- Analysis of Scheduling the Independent CCHBs for Partially Reconfigurable FPGA
Abstract Views :475 |
PDF Views:99
Authors
N. Bharathi
1,
P. Neelamegam
2
Affiliations
1 School of Computing, SASTRA University, Thanjavur 613401, IN
2 School of Electrical & Electronics Engineering, SASTRA University, Thanjavur 613401, IN
1 School of Computing, SASTRA University, Thanjavur 613401, IN
2 School of Electrical & Electronics Engineering, SASTRA University, Thanjavur 613401, IN
Source
Indian Journal of Science and Technology, Vol 6, No 4 (2013), Pagination: 4317-4323Abstract
The emerging reconfigurable computing reduces the need of computation exhaustive applications, which are always demanding more efficient computation hardware. The partially reconfigurable Field Programmable Gate Arrays (FPGA) are highly suitable for performance improvement. This paper discusses the study of FPGA utilization when scheduling fixed size configurable computation hardware block (CCHB) by applying a heuristic. Based on the parameters (speedup, CCHB size etc.,) associated with the independent CCHBs, scheduling is performed and it is repeated for various sizes of FPGA. From the study of four applications from benchmark suite, it is observed that the device utilization is increased with size of CCHBs not greater than 0.5 times or not less than 0.85 times of the size of FPGA.Keywords
Field Programmable Gate Array (FPGA), Scheduling, Configurable Computation Hardware Block (CCHB), Response Time, UtilizationFull Text
References
- Ahmadinia A, Bobda C et al. (2004). Task scheduling for heterogeneous reconfigurable computers, Proceedings of the 17th Symposium on Integrated Circuits and System Design, 22-27.
- Belviranli M E, Bhuyan L N et al. (2013). A dynamic self-scheduling scheme for heterogeneous multiprocessor architectures, Transactions on Architecture and Code Optimization, vol 9(4).
- Carvalho E, Calazans N et al. (2004). PADReH - A framework for the design and implementation of dynamically and partially reconfigurable systems. Proceedings of the 17th Symposium on Integrated Circuits and System Design, 10-15.
- Compton K, Li Z et al. (2002). Configuration relocation and defragmentation for run-time reconfigurable computing, IEEE Transactions on Very Large Scale Integration (VLSI) Systems, vol 10(3), 209-220.
- Guthaus M R, Ringenberg J S et al. (2001). MiBench: A free, commercially representative embedded benchmark suite, IEEE International Workshop on Workload Characterization WWC-4, 3-14.
- Hong C, Benkrid K et al. (2011). Efficient on-chip task scheduler and allocator for reconfigurable operating systems, IEEE Embedded Systems Letters, vol 3(3), 85-88.
- Lam S K, Bharathi N K et al. (2006). Efficient management of custom instructions for run-time reconfigurable instruction set processors, IEEE International Conference on Field Programmable Technology, 261-264.
- Lu Y, Marconi T et al. (2009). Online task scheduling for the FPGA-based partially reconfigurable systems, Proceedings of the 5th International Workshop on Reconfigurable Computing: Architectures, Tools and Applications, vol (5453), 216-230.
- Martín P, Bueno E et al. (2012). An FPGA-based approach to the automatic generation of VHDL code for industrial control systems applications: A case study of MSOGIs implementation, Mathematics and Computers in Simulation, In Press, Corrected Proof, Available online 27 July 2012.
- Sokouti M, Sokouti B et al. (2010). FPGA implementation of improved version of the Vigenere cipher, Indian Journal of Science and Technology, vol 3(4), 459-462.
- Liu P, Wu J et al. (2012). Hybrid algorithms for hardware/software partitioning and scheduling on reconfigurable devices, Mathematical and Computer Modelling, In Press, Corrected Proof, Available online 16 November 2012.
- Resano J, Mozos D et al. (2005). A Hybrid Prefetch Scheduling Heuristic to Minimize at Run-Time the Reconfiguration Overhead of Dynamically Reconfigurable Hardware, Proceedings of the Conference on Design, Automation and Test in Europe, vol 1, 106-111.
- Bhandari S U, Subbaraman S et al. (2010). Internal dynamic partial reconfiguration for real time signal processing on FPGA, Indian Journal of Science and Technology, vol 3(4), 365-368.
- Steiger C, Walder H et al. (2004). Operating systems for reconfigurable embedded platforms: online scheduling of real-time tasks, IEEE Transactions on Computers, vol 53(11), 1393-1407.
- Todman T J, Constantinides G A et al. (2005). Reconfigurable computing: architectures and design methods, IEEE conference Proceedings on Computers and Digital Techniques, vol 152(2), 193-207.
- Yin J, Zheng B et al. (2012). A hybrid real-time fault-tolerant scheduling algorithm for partial reconfigurable system, Journal of Computers, vol 7(11), 2773-2780.
- Zhou X, Liang L et al. (2008) Online Task Scheduling for Heterogeneous Reconfigurable Systems, 11th International Conference on Computer Supported Cooperative Work in Design IV, vol 5236, 596-607.
- Xilinx Platform FPGAs. [Online]. Available from: http://www.xilinx.com
- FPGA Based Software Testing Prioritization Using RnK-Means Clustering
Abstract Views :149 |
PDF Views:0
Authors
N. Bharathi
1,
P. Neelamegam
2
Affiliations
1 School of Computing, SASTRA University, IN
2 School of Electrical and Electronics Engineering, SASTRA University, IN
1 School of Computing, SASTRA University, IN
2 School of Electrical and Electronics Engineering, SASTRA University, IN
Source
ICTACT Journal on Soft Computing, Vol 4, No 1 (2013), Pagination: 656-661Abstract
Testing the software is to validate its correctness when it is deployed in its actual environment. Various test cases should be implemented and tested to validate the software. When more than one test case is involved, the order of testing needs to be prioritized to optimize the testing process. This paper proposed a prioritization method with repeated n times K means (RnK-means) clustering. Priority for the test cases is assigned based on the cluster mean values by executing RnK-means for each factor of test cases. Existing techniques are calculating merely the average of factor weights for each test case for deciding priority. The proposed method involves K-means computations and it is accelerated by FPGA for deciding priority. The observed results proved 20 percent better performance with RnK-means clustering than the existing weighted average method.Keywords
K-means Clustering, Field Programmable Gate Array (FPGA), ATM Application, Scalability, User Friendliness.
- OFDM Techniques for MIMO-OFDM System: A Review
Abstract Views :131 |
PDF Views:0
Authors
Affiliations
1 School of Electrical and Electronics Engineering, SASTRA University, Thanjavur – 613401, Tamil Nadu, IN
1 School of Electrical and Electronics Engineering, SASTRA University, Thanjavur – 613401, Tamil Nadu, IN
Source
Indian Journal of Science and Technology, Vol 8, No 22 (2015), Pagination:Abstract
MIMO-OFDM technology converts frequency selective MIMO channel into number of parallel flat fading MIMO channel.It fundamentally simplifies the baseband receiver processing by eliminating the need of complex MIMO equalizer. In this paper every one of the strategies that provide increased BER performance for OFDM has been discussed. Linear Constellation Precoding (LCP) with subcarrier grouping technique has been introduced to overcome the multipath fading that result from conventional OFDM. Later on Nonlinear Constellation Precoding (NCP) without subcarrier grouping is introduced to replace the LCP technique. NCP strategy is adaptable to diversity channels and diversity order irrespective of their number which is not in case of LCP scheme. At end Nonlinear Constellation Precoding (NCP) with subcarrier grouping is introduced. As a conclusion, in future if the same procedures are implemented in the OFDM part of MIMO-OFDM system it will provide improved BER than conventional MIMO-OFDM system.Keywords
Bit Error Rate, Diversity Channel Selection, Linear Constellation Precoding, Maximum Distance Separable codes, Nonlinear Constellation PrecodingFull Text