Re: [BGL] Using BGL for huge graphs

From: Chris Russell (cdr_at_[hidden])
Date: 2003-02-02 23:39:29

Erik, how huge is huge? Heap requirements in excess of 2^64 bytes huge? If
so, that's one _massive_ graph and some supercomputer programmer will have
to help. If not, then why not leverage the full virtual memory space
allocated to your process and let the OS worry about paging the data in/out
of physical memory? Seems like if you can fit into 2^32 (Xeon workstation)
or 2^64 then an Itanium or Alpha (4-processor Alpha servers running DEC UNIX
are real cheap on eBay these days) with a fiber channel drive array (striped
config for maximum throughput) might do the trick? If this is even close to
reasonable suggestion then you might check out the non-linear video editing
guys for ideas on drive arrays (e.g. http://www.avid.com,
http://www.media100.com).

- Regards
cdr

"Erik Arner" <yg-boost-users_at_[hidden]> wrote in message
news:3E3A64FB.90002_at_cgb.ki.se...
>
> Hi,
>
> has anybody tried using BGL for really huge graphs? I mean graphs that
> are so big that there's no way to store the whole graph in memory. Any
> ideas on how it should be implemented?
>
> My first thought is that it should be fairly straightforward: simply
> construct classes that model Sequence or RandomAccessContainer for the
> VertexList parameter etc. The classes store part of the data in memory
> and read/write data to disc when necessary.
>
> Any pitfalls, gotchas or other stuff I should be aware of before
> embarking on this?
>
> Thanks,
> /Erik
>
>
>
>
> Info: <http://www.boost.org>
> Wiki: <http://www.crystalclearsoftware.com/cgi-bin/boost_wiki/wiki.pl>
> Unsubscribe: <mailto:boost-users-unsubscribe_at_[hidden]>
>
>
> Your use of Yahoo! Groups is subject to http://docs.yahoo.com/info/terms/
>
>
>