Back to articles
Volume: 28 | Article ID: art00005
Energy efficient algorithm for lookup-tables on mobile devices
  DOI :  10.2352/ISSN.2470-1173.2016.7.MOBMU-290  Published OnlineFebruary 2016

In this paper we present a novel approach for energy efficient hash table design. Hash table is a common approach to build associative arrays, database indexes and various kinds of program-defined caches. These data structures play a crucial role in modern feature-rich mobile applications. It in turn leads to significant power consumption associated with their use. However, modern hashing techniques are suffered from large probability of collision in the case of hash size acceptable for mobile devices. This makes it necessary to perform additional energy-inefficient memory access operations to resolve these collisions. We propose hashing technique with lower probability of collision for the hash of the same size. We show that unlike existing collision free approaches our hashing method has a much broader area of applicability. To support these claims both theoretical and experimental studies are presented. Experimental comparison with existing approaches has shown significant improvement of energy-efficiency for common applications.

Subject Areas :
Views 66
Downloads 1
 articleview.views 66
 articleview.downloads 1
  Cite this article 

Sergey Makov, Vladimir Frantc, Viacheslav Voronin, Igor Shrayfel, Vadim Dubovskov, Ilya Svirin, "Energy efficient algorithm for lookup-tables on mobile devicesin Proc. IS&T Int’l. Symp. on Electronic Imaging: Mobile Devices and Multimedia: Enabling Technologies, Algorithms, and Applications,  2016,

 Copy citation
  Copyright statement 
Copyright © Society for Imaging Science and Technology 2016
Electronic Imaging
Society for Imaging Science and Technology
7003 Kilworth Lane, Springfield, VA 22151 USA