MASON-INTEREST-L Archives

November 2010

MASON-INTEREST-L@LISTSERV.GMU.EDU

Options: Use Monospaced Font
Show HTML Part by Default
Condense Mail Headers

Message: [<< First] [< Prev] [Next >] [Last >>]
Topic: [<< First] [< Prev] [Next >] [Last >>]
Author: [<< First] [< Prev] [Next >] [Last >>]

Print Reply
Sender:
MASON Multiagent Simulation Toolkit <[log in to unmask]>
Date:
Mon, 8 Nov 2010 11:10:57 -0500
MIME-version:
1.0 (Apple Message framework v936)
Reply-To:
MASON Multiagent Simulation Toolkit <[log in to unmask]>
Content-type:
text/plain; charset=US-ASCII; format=flowed; delsp=yes
Subject:
From:
Sean Luke <[log in to unmask]>
In-Reply-To:
Content-transfer-encoding:
7bit
Comments:
cc: Liviu Panait <[log in to unmask]>, "Maciej M. Latek" <[log in to unmask]>
Parts/Attachments:
text/plain (81 lines)
Martin, the right person to look into this is Gabriel Balan, and to a  
lesser extend Liviu Panait (whom I am cc:ing).  They were the two who  
put this package together way back when.  Gabriel is moving to New  
Hampshire so may be in radio silence right now however.

In the meantime we need to nail down whether or not it's a recursion  
bug or a um, misfeature.  Try increasing the stack size in Java.  This  
is done with the -Xss parameter.  The default value is probably 512K.   
Try increasing it considerably, like

	java -Xss16392k ...

You should also increase the heap I guess.  I'd do something like:

	java -Xss16392k -Xmx500M -Xms500M ...

If you can't find a stack size which will complete the task, then it's  
possibly the case that we're seeing a recursion bug here rather than a  
maximal graph limit.

Your other option is to go with Jung.  Now beware: I believe that Jung  
isn't serializable, so you may be stuck unable to checkpoint out.  I  
am cc:ing Maciej Latek, who knows a lot about jerry-rigging MASON to  
Jung.

Sean


On Nov 8, 2010, at 10:52 AM, Martin Pokropp wrote:

> Dear Sean, Dear Mason Users,
>
>
> For my simulated undirected network I intend to use the additional  
> socialnets package provided with Mason. My network has 30000 nodes  
> and is sparse with about 6 edges per node.
>
> As there are isolated nodes, I cannot get the mean Shortest Path of  
> the whole network. Instead, I'm trying to analyse the biggest  
> connected component by using
>
> sim 
> .field 
> .network.stats.ConnectivityStatistics.getConnectedComponents(network)
>
> Unfortunately the VM throws multiple stack overflow errors:
>
>
> Exception in thread "main" java.lang.StackOverflowError
>     at sim.field.network.Network.getNodeIndex(Network.java:618)
>     at sim.field.network.stats.ConnectivityStatistics 
> $ConnectedComponentFactory.exploreU(ConnectivityStatistics.java:220)
>     at sim.field.network.stats.ConnectivityStatistics 
> $ConnectedComponentFactory.exploreU(ConnectivityStatistics.java:222)
>     at sim.field.network.stats.ConnectivityStatistics 
> $ConnectedComponentFactory.exploreU(ConnectivityStatistics.java:222)
>     at sim.field.network.stats.ConnectivityStatistics 
> $ConnectedComponentFactory.exploreU(ConnectivityStatistics.java:222)
>     at sim.field.network.stats.ConnectivityStatistics 
> $ConnectedComponentFactory.exploreU(ConnectivityStatistics.java:222)
>     at sim.field.network.stats.ConnectivityStatistics 
> $ConnectedComponentFactory.exploreU(ConnectivityStatistics.java:222)
>     at sim.field.network.stats.ConnectivityStatistics 
> $ConnectedComponentFactory.exploreU(ConnectivityStatistics.java:222)
>     at sim.field.network.stats.ConnectivityStatistics 
> $ConnectedComponentFactory.exploreU(ConnectivityStatistics.java: 
> 222 ...
>
> I guess that there are too many recursions and the  
> getConnectedComponents method is not appropriate for networks such  
> as mine?
>
> Best Regards,
>
> Martin
>
>
>
>
>

ATOM RSS1 RSS2