Account Options

  1. Sign in
The old Google Groups will be going away soon, but your browser is incompatible with the new version.
Google Groups Home
« Groups Home
Message from discussion adjustable arrays
The group you are posting to is a Usenet group. Messages posted to this group will make your email address visible to anyone on the Internet.
Your reply message has not been sent.
Your post was successful
 
From:
To:
Cc:
Followup To:
Add Cc | Add Followup-to | Edit Subject
Subject:
Validation:
For verification purposes please type the characters you see in the picture below or the numbers you hear by clicking the accessibility icon. Listen and type the numbers you hear
 
Robert Maas, http://tinyurl.com/uh3t  
View profile  
 More options May 2 2010, 3:57 am
Newsgroups: comp.lang.lisp
From: seeWebInst...@rem.intarweb.org (Robert Maas, http://tinyurl.com/uh3t)
Date: Sat, 01 May 2010 23:57:25 -0800
Local: Sun, May 2 2010 3:57 am
Subject: Re: adjustable arrays

> From: Peter Keller <psil...@merlin.cs.wisc.edu>
> To give an example of the problems I'm facing, suppose I have 10,000 clients:
> If I have a 16k initial read buffer for each client which can grow in
> size up to 128k as needed, then just for the read buffers alone I'll need:
> 156MB up to 1.250GB of memory needed.
> ...
> That is a lot of memory to keep resident and perform churn on and hence
> why I'm very paranoid about consing or calling make-array.  I use other
> libraries and things and who knows what their memory usages are. But
> at the scaling levels I'm desiring, I have to pay attention to it.

With so many clients you must synchronize, why even *try* to store
the data in Lisp arrays? Why not use MySQL as your datastore, or if
you need higher performance and have lots of $cash$ then use Oracle
instead?

 
You must Sign in before you can post messages.
To post a message you must first join this group.
Please update your nickname on the subscription settings page before posting.
You do not have the permission required to post.