On Sat, Oct 12, 2013 at 12:58 PM, Rakesh Pandit wrote: > Hi, > > I had a question before I can start trying out fastbit for my experiment. > I need to do an operation billion times and save 0 or 1 in a bitmap which > will take as much as 128 MB of RAM in a handheld machine. > > The amount of free ram in this handheld machine after loading kernel and > other very important application is less and I don't know about entropy of > bits or whether they follow any pattern. They can be anything and my aim is > to create this bitmap and keep it compressed all the time while creating. > > Does WAH allows to do that (and fastbit library) ? > > As an example I ran this experiment with 1073741824 bits (128 MB) of > uncompressed bitmap on handheld device with plenty of RAM and it runs fine, > but once everything important is loaded then there isn't much left. My > target is to reduce the memory usage as much as possible. > > One important aspect which I forgot to mention is that while creating bitmap I want to set bits randomly and they wouldn't be increasing order. They can be anyplace depending upon result of operation e.g. sequence could be 3000th, 1999th, 888888th, 1st etc
Regards, Rakesh
_______________________________________________ FastBit-users mailing list [email protected] https://hpcrdm.lbl.gov/cgi-bin/mailman/listinfo/fastbit-users
