• Documents
  • Authors
  • Tables
  • Other Seers ▼
    RefSeer AckSeer CollabSeer SeerSeer
  • Log in
  • Sign up
  • MetaCart

CiteSeerX logo

Advanced Search Include Citations
Advanced Search Include Citations | Disambiguate

D.Lavenier, “Experience with a Hybrid Processor: K-Means Clustering,”J. Supercomputing (2003)

by J Frigo M Gokhale, J Theiler K McCabe, C Wolinski
Add To MetaCart

Tools

Sorted by:
Results 1 - 2 of 2

Polymorphous fabric-based systems: Model, tools, applications

by Christophe Wolinski, Maya Gokhale, Kevin McCabe - JOURNAL OF SYSTEMS ARCHITECTURE , 2003
"... A Fabric Based System is a parameterized cellular architecture in which an array of computing cells communicates with an embedded processor through a global memory. This architecture is customizable to different classes of applications by funtional unit, interconnect, and memory parameters, and can ..."
Abstract - Cited by 3 (0 self) - Add to MetaCart
A Fabric Based System is a parameterized cellular architecture in which an array of computing cells communicates with an embedded processor through a global memory. This architecture is customizable to different classes of applications by funtional unit, interconnect, and memory parameters, and can be instantiated efficiently on platform FPGAs. In previous work [1], we have demonstrated the advantage of reconfigurable fabrics for image and signal processing applications. Recently, we have build a Fabric Generator FG, a Java-based toolset that greatly accelerates construction of the fabrics. A module-generation library is used to define, instantiate, and interconnect cells’ datapaths. FG also generates customized sequencers for individual cells or collections of cells. We describe the Fabric-Based System model, the FG toolset, and concrete realizations of fabric architectures generated by FG on the Altera Excalibur

Hardware Enhancement Association Rule with Privacy Preservation 1 *2

by Phani Ratna, Sri Redipalli, G. Srinivasa Rao
"... In recent days Data mining techniques have been widely used in various applications. One of the most important applications in data mining is association rule mining. For hardware implementation of Aprioribased association rule mining we have to load candidate item sets and a database into the hardw ..."
Abstract - Add to MetaCart
In recent days Data mining techniques have been widely used in various applications. One of the most important applications in data mining is association rule mining. For hardware implementation of Aprioribased association rule mining we have to load candidate item sets and a database into the hardware. As the hardware architecture capacity is fixed, when the number of items or the number of candidate item sets in database is larger than the hardware capacity, the items are loaded into the hardware separately. Which increases the time complexity to those steps that require to load candidate item sets or database items into the hardware which is proportional to the number of candidate item sets multiplied by the number of items in the database. As the time complexity is increasing because of many candidate item sets and use of large database, which is finally reflecting the performance bottleneck. In this paper, we propose a HAsh-based and PiPelIned (abbreviated as HAPPI) architecture to enhance the implementation of association rule mining on hardware. Hence, we can effectively decrease the frequency of loading the database into the hardware. HAPPI solves the bottleneck problem in a priori-based hardware schemes. Along with this hashing we are including here the privacy preservation for the sensitive data that is processing in the data mining. It is a common problem that is being faced by all Data
The National Science Foundation
  • About CiteSeerX
  • Submit Documents
  • Privacy Policy
  • Help
  • Data
  • Source
  • Contact Us

Developed at and hosted by The College of Information Sciences and Technology

© 2007-2010 The Pennsylvania State University