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
Upper limits of CL
There are currently too many topics in this group that display first. To make this topic appear first, remove this option from another topic.
There was an error processing your request. Please try again.
flag
  Messages 51 - 74 of 74 - Collapse all  -  Translate all to Translated (View all originals) < Older 
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
 
Erik Naggum  
View profile  
 More options Jun 20 2002, 1:57 pm
Newsgroups: comp.lang.lisp
From: Erik Naggum <e...@naggum.net>
Date: Thu, 20 Jun 2002 17:57:52 GMT
Local: Thurs, Jun 20 2002 1:57 pm
Subject: Re: Upper limits of CL
* Joel Ray Holveck
| Easy, Erik!  The OP made it clear that this was a curiosity thing; he didn't
| indicate that it was an immediate need.  I see no need to get upset.

  Like I need a reason to get upset.  :)

  IMNSHO, we are at a point of technological development where the hardware is
  so extremely underutilized that it is insulting to everybody involved to ask
  for more.  This is like the pampered child who whines for another soft pillow
  to keep from actually moving his body to correct the inevitable pain of _not_
  moving.  Just imagine what the engineers who worked miracles with 16K could
  have done with the gigabyte now wasting away in my computer!  I still have
  only two 600MHz Pentium III processors with that memory, which is slow by
  today's standards, and that means the otherwise great website for the movie
  Minority Report takes real effort for the processors to show and the flash
  animation is jerky and when Mozilla needs that last 200M block of memory and
  the swap disk lamp starts flashing, I am reminded of the stupid ad for some
  German car maker: "The new <car> has more computing power than it took to
  send a man to the moon!" (I think my trusty old HP48GX does, too), and my
  first thought was "and yet you are stuck here on earth?"

  I have to wonder what went wrong and where when I get a 900K message encoded
  with BASE64 and MIME and some HTML crap that only contains a _compressed_
  archive of two Word documents that contains a very nice invitation, but which
  would have been only about 60K of network traffic had it been made into a PNG
  graphic and they had sent me a URL to it, not to mention that it would have
  taken approximately a millionth of the processing power to show it to me that
  way than it took to decrypt the Word idiocy -- and since I do not actually
  have Word, either, it probably looks much less ... inviting.  Then I keep
  thinking that I will be stuck here on earth for a _long_ while.

  Curiosity is not a bad thing.  However, too much idle curiosity and too
  little engineering-style or researcher-style curiosity _is_ a bad thing.
  Idle curiosity makes people lose track of any _purpose_ to their thinking.
  With all the work we have done improve information technology, one would
  think that it should be easier to maintain a sustained focus, but not so.
  Concentration and attention are in short supply all over the Western world,
  mostly because of what I consider the worst plague on mankind ever: rampant
  and uncontrolled information pollution in the form of advertising, but also
  because the energy required to maintain and sustain focus has increased in
  our culture.  Cognitive overload causes a constant stress level that taxes
  people's ability to stay focused even on their conscious purposes.  It is
  like high caffeine "poisoning", except a rambling flow of thought and speech
  is no longer considered a symptom of anything wrong.  Idle curiosity is just
  like that rambling flow of thought that produces exactly nothing worthwhile.
--
  Guide to non-spammers: If you want to send me a business proposal, please be
  specific and do not put "business proposal" in the Subject header.  If it is
  urgent, do not use the word "urgent".  If you need an immediate answer, give
  me a reason, do not shout "for your immediate attention".  Thank you.


 
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.
Lieven Marchand  
View profile  
 More options Jun 20 2002, 5:54 pm
Newsgroups: comp.lang.lisp
From: Lieven Marchand <m...@wyrd.be>
Date: 20 Jun 2002 21:34:09 +0200
Local: Thurs, Jun 20 2002 3:34 pm
Subject: Re: Upper limits of CL

Greg Menke <gregm-use...@mindspring.com> writes:
> It was asserted to me that inverting the array was meaningful- however
> I don't know the exact application beyond its something a CS prof at
> the local university is working with.

I really doubt it. In the standard texts on numerical linear algebra,
inverting matrices hardly shows up. What are you going to do with the
result? Multiplying it with another matrix can be done equally well by
LU factorization and back substitution. For other problems things like
QR factorization, Givens or Householder transforms or stuff like that
might come into play, but I've never seen an algorithm that called for
inverting large matrices.

> The prof in question ended up working up a Pascal program (poor guy-
> the C people have it good compared to the Pascal people) using then
> "Strassen algorithm".  I don't know if its finished running yet...

The Strassen algorithm is an algorithm to multiply matrices faster
than the obvious O(n^2) approach.

--
Bored, now.
Lieven Marchand <m...@wyrd.be>


 
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.
Greg Menke  
View profile  
 More options Jun 20 2002, 7:05 pm
Newsgroups: comp.lang.lisp
From: Greg Menke <gregm-use...@mindspring.com>
Date: 20 Jun 2002 19:04:57 -0400
Local: Thurs, Jun 20 2002 7:04 pm
Subject: Re: Upper limits of CL

> > It was asserted to me that inverting the array was meaningful- however
> > I don't know the exact application beyond its something a CS prof at
> > the local university is working with.

> I really doubt it. In the standard texts on numerical linear algebra,
> inverting matrices hardly shows up. What are you going to do with the
> result? Multiplying it with another matrix can be done equally well by
> LU factorization and back substitution. For other problems things like
> QR factorization, Givens or Householder transforms or stuff like that
> might come into play, but I've never seen an algorithm that called for
> inverting large matrices.

I don't know what he's doing it for.  For all I know he was trying to
make it work just as a simple exercise.  At one point he attempted it
using files for the data & estimated it would take ~50 days to
complete.  I also don't know how efficient his algorithm was, but I
suspect it would have been a fseek(), fread() kind of thing for each
cell.  He was happier with the Strassen approach.

Since Common Lisp is cool & fun to use, I thought of asking about how
it might handle the problem.

Regards,

Gregm


 
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.
Joseph Dale  
View profile  
 More options Jun 21 2002, 12:00 am
Newsgroups: comp.lang.lisp
From: Joseph Dale <jd...@uclink.berkeley.edu>
Date: Fri, 21 Jun 2002 04:00:26 GMT
Local: Fri, Jun 21 2002 12:00 am
Subject: Re: Upper limits of CL

Lieven Marchand wrote:
> The Strassen algorithm is an algorithm to multiply matrices faster
> than the obvious O(n^2) approach.

It may have been a typo, but just for the record, the naive method for
matrix multiplication is O(n^3), not O(n^2). Strassen's algorithm is
O(n^2.81), and the best known upper bound for any matrix multiplication
algorithm was O(n^2.376) at the time of the publication of the first
edition of CLR (1990, I think).

Also, FWIW, there are algorithms for matrix inversion which reduce it to
a bunch of multiplications of smaller matrices, so Strassen's algorithm
does come into play there.

Joe


 
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.
Patrick W  
View profile  
 More options Jun 24 2002, 4:48 pm
Newsgroups: comp.lang.lisp
From: "Patrick W" <xne...@yahoo.com.au>
Date: Tue, 25 Jun 2002 06:48:54 +1000
Local: Mon, Jun 24 2002 4:48 pm
Subject: Re: Upper limits of CL

"Tim Bradshaw" <t...@cley.com> wrote in message

news:ey3hejya1ru.fsf@cley.com...

> I spend half my life trying to batter this into people.  People have
> *really strange ideas* about what is expensive and what is cheap.

I found a ridiculous example of this the other day. The author of a tech mag
article argued that, when Sun Microsystems needed a widget toolkit for their
StarOffice suite, they chose GTK over Qt because they would have to _pay_
for commercial Qt licences.

 
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.
Raymond Toy  
View profile  
 More options Jun 25 2002, 9:13 am
Newsgroups: comp.lang.lisp
From: Raymond Toy <t...@rtp.ericsson.se>
Date: 25 Jun 2002 09:10:14 -0400
Local: Tues, Jun 25 2002 9:10 am
Subject: Re: Upper limits of CL

>>>>> "Patrick" == Patrick W <xne...@yahoo.com.au> writes:

    Patrick> "Tim Bradshaw" <t...@cley.com> wrote in message
    Patrick> news:ey3hejya1ru.fsf@cley.com...

    >> I spend half my life trying to batter this into people.  People have
    >> *really strange ideas* about what is expensive and what is cheap.

    Patrick> I found a ridiculous example of this the other day. The author of a tech mag
    Patrick> article argued that, when Sun Microsystems needed a widget toolkit for their
    Patrick> StarOffice suite, they chose GTK over Qt because they would have to _pay_
    Patrick> for commercial Qt licences.

Does OpenOffice and StarOffice share code in the same way that Mozilla
and Netscape share code?  That would be a really good incentive to
choose a free widget toolkit.

Maybe a commercial Qt license says $100 per StarOffice sold.  That
might be a problem when Sun is trying to sell StarOffice for $75.  Not
having looked at the actual cost of a Qt license, I'm totally guessing.

What I find strange is that I know of places where they refuse to buy
a few $5-10 K Sun boxes for individuals who probably cost the company
a quarter million each with overhead.  But, then they don't even blink
an eye when you tell them you need a quarter million dollar piece of
protocol test equipment.  Of course, without the equipment, you can't
test what you've made.  But if the people don't have fast enough
computers to do the work, your products are even later than you might
wish, which then costs you tens of millions in lost sales, etc.  

I have no understanding of how management thinks.  Guess I'll never be
a manager.

Now that is *really strange idea* of what's expensive and what's
cheap.

Ray


 
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.
Joe Marshall  
View profile  
 More options Jun 25 2002, 9:37 am
Newsgroups: comp.lang.lisp
From: "Joe Marshall" <prunesqual...@attbi.com>
Date: Tue, 25 Jun 2002 13:37:47 GMT
Local: Tues, Jun 25 2002 9:37 am
Subject: Re: Upper limits of CL

"Raymond Toy" <t...@rtp.ericsson.se> wrote in message news:4n3cvbjyh5.fsf@rtp.ericsson.se...

> I have no understanding of how management thinks.

You're starting from the false premise that management thinks at all.

 
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.
Erik Naggum  
View profile  
 More options Jun 25 2002, 10:05 am
Newsgroups: comp.lang.lisp
From: Erik Naggum <e...@naggum.net>
Date: Tue, 25 Jun 2002 14:05:43 GMT
Local: Tues, Jun 25 2002 10:05 am
Subject: Re: Upper limits of CL
* Joe Marshall
| You're starting from the false premise that management thinks at all.

  Oh, management thinks.  It just does not think about things that matter to
  non-management.  There is lots and lots of evidence of thinking mangagers,
  but they evidently value wildly different things than non-management.  E.g.,
  in a huge corporation from which several of my friends have fled recently,
  management at all levels have generous bonus programs, thought to be a kind
  of motivator, but it leads to a very curious metric for all ideas that are
  offered them: "How does this affect my bonus?"  Needless to say, when bonuses
  are paid at the end of every quarter, any idea that fails to promise a bonus
  increase for that particular manager in the current or next quarter is just
  ignored or worse, yet, is actively blocked from propagated upwards because
  the lowest-level manager does not want others to get a bonus for his work.
  It is somewhat like giving children candy for everything they do to motivate
  them -- you get to pay for it in dental health bills.  Generally speaking,
  they provide some evidence to the theory that motivation does not motivate,
  it only demotivates that which is not explicitly motivated.  Management is
  generall running on the wrong kinds of stimulators and motivators.
--
  Guide to non-spammers: If you want to send me a business proposal, please be
  specific and do not put "business proposal" in the Subject header.  If it is
  urgent, do not use the word "urgent".  If you need an immediate answer, give
  me a reason, do not shout "for your immediate attention".  Thank you.


 
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.
Raymond Toy  
View profile  
 More options Jun 25 2002, 11:53 am
Newsgroups: comp.lang.lisp
From: Raymond Toy <t...@rtp.ericsson.se>
Date: 25 Jun 2002 11:52:35 -0400
Local: Tues, Jun 25 2002 11:52 am
Subject: Re: Upper limits of CL

>>>>> "Erik" == Erik Naggum <e...@naggum.net> writes:

    Erik> * Joe Marshall
    Erik> | You're starting from the false premise that management thinks at all.

    Erik>   Oh, management thinks.  It just does not think about things that matter to
    Erik>   non-management.  There is lots and lots of evidence of thinking mangagers,
    Erik>   but they evidently value wildly different things than non-management.  E.g.,
    Erik>   in a huge corporation from which several of my friends have fled recently,
    Erik>   management at all levels have generous bonus programs, thought to be a kind
    Erik>   of motivator, but it leads to a very curious metric for all ideas that are
    Erik>   offered them: "How does this affect my bonus?"  Needless to say, when bonuses
    Erik>   are paid at the end of every quarter, any idea that fails to promise a bonus
    Erik>   increase for that particular manager in the current or next quarter is just
    Erik>   ignored or worse, yet, is actively blocked from propagated upwards because
    Erik>   the lowest-level manager does not want others to get a bonus for his work.
    Erik>   It is somewhat like giving children candy for everything they do to motivate
    Erik>   them -- you get to pay for it in dental health bills.  Generally speaking,
    Erik>   they provide some evidence to the theory that motivation does not motivate,
    Erik>   it only demotivates that which is not explicitly motivated.  Management is
    Erik>   generall running on the wrong kinds of stimulators and motivators.

Yeah, this really sucks.  In the meantime, they just grind the workers
into total apathy and eventual departure, thereby losing all the good
guys they had, so now they have no hope to actually get anything done
to get their big bonuses, except that they probably will because they
saved the company big bucks by making everyone leave and didn't have
to pay severance. :-)

I've always felt that business management should be paid the same way
sports managers are paid.  The players (i.e. me! :-) ) get paid the
big bucks because they actually make things happen.  After all, I
don't go to a game to see a manager shouting at everyone; I go to see
the players do their magic.

Ray, the worker bee


 
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.
Patrick W  
View profile  
 More options Jun 25 2002, 11:56 am
Newsgroups: comp.lang.lisp
From: "Patrick W" <xne...@yahoo.com.au>
Date: Wed, 26 Jun 2002 01:56:57 +1000
Local: Tues, Jun 25 2002 11:56 am
Subject: Re: Upper limits of CL

"Raymond Toy" <t...@rtp.ericsson.se> wrote in message

news:4n3cvbjyh5.fsf@rtp.ericsson.se...

> Does OpenOffice and StarOffice share code in the same way that Mozilla
> and Netscape share code?  That would be a really good incentive to
> choose a free widget toolkit.

There may be some licensing issues[*] that make GTK+ a better choice, but I
was commenting on the notion that Qt is prohibitively expensive to Sun
Microsystems. (A Qt license is comparable to buying a copy of Visual C++.
It's a one-off payment. No royalties involved).

[*] A commercial Qt license is only required for proprietary products. Qt is
also licensed under the GPL, but only the X11 version is GPL'd. A no-cost
"non-commercial" version exists for Windows, which can be used in products
licensed under the LGLP or a BSD-style license. OpenOffice is distributed
under the LGPL (which presents no problem for use with Qt), but it's also
released under the "Sun Industry Standards Source License" which may or may
not be incompatible with either the GPL'd Qt or the "non-commercial" Qt. (I
haven't checked, and don't really care) ;-)


 
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.
Joe Marshall  
View profile  
 More options Jun 25 2002, 2:24 pm
Newsgroups: comp.lang.lisp
From: "Joe Marshall" <prunesqual...@attbi.com>
Date: Tue, 25 Jun 2002 18:24:39 GMT
Local: Tues, Jun 25 2002 2:24 pm
Subject: Re: Upper limits of CL

"Raymond Toy" <t...@rtp.ericsson.se> wrote in message news:4nk7onice4.fsf@rtp.ericsson.se...

> I've always felt that business management should be paid the same way
> sports managers are paid.  The players (i.e. me! :-) ) get paid the
> big bucks because they actually make things happen.  After all, I
> don't go to a game to see a manager shouting at everyone; I go to see
> the players do their magic.

I'm ready to endorse Nike for the appropriate remuneration.

 
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.
Paolo Amoroso  
View profile  
 More options Jun 26 2002, 12:03 pm
Newsgroups: comp.lang.lisp
From: Paolo Amoroso <amor...@mclink.it>
Date: Wed, 26 Jun 2002 17:59:28 +0200
Local: Wed, Jun 26 2002 11:59 am
Subject: Re: Upper limits of CL

On Thu, 20 Jun 2002 17:57:52 GMT, Erik Naggum <e...@naggum.net> wrote:
>   moving.  Just imagine what the engineers who worked miracles with 16K could
>   have done with the gigabyte now wasting away in my computer!  I still have

Examples of what has been done with even less than 16K can be found in:

  Computers in Spaceflight: The NASA Experience
  http://www.hq.nasa.gov/office/pao/History/computers/Compspace.html

>   the swap disk lamp starts flashing, I am reminded of the stupid ad for some
>   German car maker: "The new <car> has more computing power than it took to
>   send a man to the moon!" (I think my trusty old HP48GX does, too), and my
>   first thought was "and yet you are stuck here on earth?"

:D For more info on the real thing, see:

  Apollo Guidance Computer
  http://hrst.mit.edu/hrs/apollo/public

Paolo

P.S.
By the way, the Apollo spacecraft had a "CDR" :)
--
EncyCMUCLopedia * Extensive collection of CMU Common Lisp documentation
http://www.paoloamoroso.it/ency/README


 
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.
Nicolas Neuss  
View profile  
 More options Jun 27 2002, 9:15 am
Newsgroups: comp.lang.lisp
From: Nicolas Neuss <Nicolas.Ne...@iwr.uni-heidelberg.de>
Date: 27 Jun 2002 15:01:58 +0200
Local: Thurs, Jun 27 2002 9:01 am
Subject: Re: Upper limits of CL

Raymond Toy <t...@rtp.ericsson.se> writes:
> I can understand why you might want cons cells to be small.  I find
> less of a reason for arrays, but that might be because my arrays tend
> to fairly large and one extra word out of thousands for each array is
> irrelevant to me. :-)  As an implementor, I'm sure you have a much
> different view.  Thanks for the info.

Think of using arrays to store the coordinates of the nodes of an
unstructured mesh in 1-3 dimensions and you have a lot of small
arrays.

Nicolas.


 
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.
Raymond Toy  
View profile  
 More options Jun 27 2002, 10:03 am
Newsgroups: comp.lang.lisp
From: Raymond Toy <t...@rtp.ericsson.se>
Date: 27 Jun 2002 09:58:44 -0400
Local: Thurs, Jun 27 2002 9:58 am
Subject: Re: Upper limits of CL

>>>>> "Nicolas" == Nicolas Neuss <Nicolas.Ne...@iwr.uni-heidelberg.de> writes:

    Nicolas> Raymond Toy <t...@rtp.ericsson.se> writes:
    >> I can understand why you might want cons cells to be small.  I find
    >> less of a reason for arrays, but that might be because my arrays tend
    >> to fairly large and one extra word out of thousands for each array is
    >> irrelevant to me. :-)  As an implementor, I'm sure you have a much
    >> different view.  Thanks for the info.

    Nicolas> Think of using arrays to store the coordinates of the nodes of an
    Nicolas> unstructured mesh in 1-3 dimensions and you have a lot of small
    Nicolas> arrays.

But I could also say that having a single extra header word for each
of those tiny arrays is an unacceptable solution.  :-)  Upto 50%
wasted.

So, I go for one giant array to hold everything and do the indexing
myself.  Now it's either one or two words of overhead for all of the
data.

:-)

Ray


 
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.
Carl Shapiro  
View profile  
 More options Jun 27 2002, 11:01 am
Newsgroups: comp.lang.lisp
From: Carl Shapiro <cshapiro+s...@panix.com>
Date: 27 Jun 2002 11:01:21 -0400
Local: Thurs, Jun 27 2002 11:01 am
Subject: Re: Upper limits of CL

Nicolas Neuss <Nicolas.Ne...@iwr.uni-heidelberg.de> writes:
> Think of using arrays to store the coordinates of the nodes of an
> unstructured mesh in 1-3 dimensions and you have a lot of small
> arrays.

Wouldn't small lists be the appropriate data type for storing such
coordinates?

 
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.
Duane Rettig  
View profile  
 More options Jun 27 2002, 12:00 pm
Newsgroups: comp.lang.lisp
From: Duane Rettig <du...@franz.com>
Date: Thu, 27 Jun 2002 16:00:01 GMT
Local: Thurs, Jun 27 2002 12:00 pm
Subject: Re: Upper limits of CL

Correct. The cost of such a style must be considered.  And we have
customers on both sides - ones who have rejected this approach in favor of
another, and ones who have accepted this approach because they deemed the
cost not to be too great.  Which group is right?  They both are!

> So, I go for one giant array to hold everything and do the indexing
> myself.  Now it's either one or two words of overhead for all of the
> data.

There are pros and cons to this kind of approach as well.  All in all, the
pros and cons of each approach are worthy of careful consideration and
weighing during design for each project (and according to the style of
each programmer and the problem at hand).

As an implementor of a general-purpose language, I try to give as many
options as possible to users.  Obviously, I can't please all of the
people all of the time, but I can certainly try.

--
Duane Rettig          Franz Inc.            http://www.franz.com/ (www)
1995 University Ave Suite 275  Berkeley, CA 94704
Phone: (510) 548-3600; FAX: (510) 548-8253   du...@Franz.COM (internet)


 
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.
Nicolas Neuss  
View profile  
 More options Jun 27 2002, 1:45 pm
Newsgroups: comp.lang.lisp
From: Nicolas Neuss <Nicolas.Ne...@iwr.uni-heidelberg.de>
Date: 27 Jun 2002 19:43:25 +0200
Local: Thurs, Jun 27 2002 1:43 pm
Subject: Re: Upper limits of CL

Carl Shapiro <cshapiro+s...@panix.com> writes:
> Wouldn't small lists be the appropriate data type for storing such
> coordinates?

That would need more space as much as I see (at least for 2D and 3D).
Nicolas.

 
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.
Nicolas Neuss  
View profile  
 More options Jun 27 2002, 2:00 pm
Newsgroups: comp.lang.lisp
From: Nicolas Neuss <Nicolas.Ne...@iwr.uni-heidelberg.de>
Date: 27 Jun 2002 19:55:17 +0200
Local: Thurs, Jun 27 2002 1:55 pm
Subject: Re: Upper limits of CL

You're right that this is usually more efficient.  But now imagine
this mesh being modified from time step to time step by adding and
removing points.  You would have to do some garbage collection for
your indices then, which is nontrivial.

Thus, it would be very nice for me if Matlisp could handle also small
vectors/matrices fast.  Unfortunately, the generic function call kills
you in that case.  (I'm just working on a solution for that.  At the
moment, my solution uses the deftransform construct of CMUCL.
Probably, a portable solution would be to define compiler-macros which
inline generic function calls for certain types.)

Nicolas.


 
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.
Discussion subject changed to "Cluster CL [Was: Upper limits of CL]" by Joel Ray Holveck
Joel Ray Holveck  
View profile  
 More options Jun 28 2002, 11:00 pm
Newsgroups: comp.lang.lisp
From: Joel Ray Holveck <jo...@juniper.net>
Date: 28 Jun 2002 19:58:04 -0700
Local: Fri, Jun 28 2002 10:58 pm
Subject: Cluster CL [Was: Upper limits of CL]

>> Besides, if you really need gigabyte upon gigabyte of memory
>> and the hardware to utilize it, the only thing between you and
>> satisfying that need has been money for at least 10 years.
> Exactly so, see:
>    <URL:http://www.sgi.com/origin/3000/>
>    <URL:http://www.sgi.com/products/storage/9400.html>
[snip]
> Unfortunately(?), applications that make effective *use* of all that
> horsepower at once in a single program tend to be written in Fortran
> (usually with OpenMP or MPI), not Common Lisp.

I've had a hard time finding CLs for cluster computing.  Does anybody
know if this sort of thing was ever developed as a product?

Cheers,
joelh


 
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.
Discussion subject changed to "Upper limits of CL" by Joel Ray Holveck
Joel Ray Holveck  
View profile  
 More options Jun 28 2002, 11:30 pm
Newsgroups: comp.lang.lisp
From: Joel Ray Holveck <jo...@juniper.net>
Date: 28 Jun 2002 20:27:49 -0700
Local: Fri, Jun 28 2002 11:27 pm
Subject: Re: Upper limits of CL

> Just imagine what the engineers who worked miracles with 16K could
> have done with the gigabyte now wasting away in my computer!

This much I agree with.

In an amusing twist of irony, you know the old quip (I think from Alan
Perlis):
  "Lisp programmers know the value of everything, and the cost of nothing."

These days, I tend to find systems written in Lisp to take up rather
less memory than systems in other languages.  I recently saw a bunch
of jaws hit the table when I mentioned that a program I'm developing
(in Lisp) has a 9MB dynamic dataset size, including the code.  Most of
the other coders (used to other languages) had expected something in
the 25-100 MB range.

I normally attribute this to the newest crop of coders who don't know
(and frequently don't care) how things work under the hood.  It
doesn't take a lot of in-depth analysis to keep things reasonably
tight, just a basic familiarity with The Way Things Work to sit in the
back of your head while you code.

> Curiosity is not a bad thing.  However, too much idle curiosity and too
> little engineering-style or researcher-style curiosity _is_ a bad thing.

I'm going to take this at face value, which is different than how I
read it the first time through.  I think you're saying that idle
curiosity (investigation without a purpose) is bad, unless it's mixed
in with a generous dose of researcher-style curiosity (investigation
with a purpose).  I'm not sure whether I quite agree, but I'm a little
unsure about the meaning of your terms.

I engage in a lot of both styles of curiosity, and they both pay off
regularly.  I first started learning Lisp because of a "I wonder what
it's like" thought.  I'm now using it to write programs that people
thought were unworkable.  I first picked up Principles of AI
Programming because I wondered what it had to offer.  A few months
later, I adapted one of the algorithms I learned about from it to form
the core of a major project at work.  I constantly find myself using
things that I first learned about as a result of idle curiosity.

Certainly, when I investigate something new, I think of how I can
apply it to whatever jobs I have at hand.  But just because I don't
have an immediate application doesn't keep me from investigating.

> Idle curiosity is just like that rambling flow of thought that
> produces exactly nothing worthwhile.

I'm still hazy on the definitions here, but if by "idle curiosity" you
mean "investigation without a definite, immediate, application", then
I'm going to have to disagree.  I named a couple of counterexamples
from my own experiences above, and I've found that what I've learned
without an immediate purpose (at that time) has helped me time and
time again.  It provides me with a vast toolkit that I can use to
tackle new and unusual problems, and gives me a broader perspective
that I can use to deal with new situations.

But that's just my experience.

Cheers,
joelh


 
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.
Erik Naggum  
View profile  
 More options Jun 29 2002, 12:51 am
Newsgroups: comp.lang.lisp
From: Erik Naggum <e...@naggum.net>
Date: Sat, 29 Jun 2002 04:51:41 GMT
Local: Sat, Jun 29 2002 12:51 am
Subject: Re: Upper limits of CL
* Joel Ray Holveck
| I'm going to take this at face value, which is different than how I read it
| the first time through.  I think you're saying that idle curiosity
| (investigation without a purpose) is bad, unless it's mixed in with a
| generous dose of researcher-style curiosity (investigation with a purpose).

  The kind of idle curiosity I refer to is the that calls up an ISP and wonders
  what it would cost to give him a 100Mbps pipe with an average load of 20Mbps,
  but has no intention of buying _anything_ -- he would just sort of like to
  know, without saying so up front, admitting that he feared he would not get
  the right answer if he did not pretend he was buying.  But I guess I would
  not believe such people existed, either, if I had not experienced them first
  hand.  Idle curiosity is the kind that you would like to invoice people for
  after wasting somebody's paid time.
--
  Guide to non-spammers: If you want to send me a business proposal, please be
  specific and do not put "business proposal" in the Subject header.  If it is
  urgent, do not use the word "urgent".  If you need an immediate answer, give
  me a reason, do not shout "for your immediate attention".  Thank you.


 
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.
Discussion subject changed to "Cluster CL [Was: Upper limits of CL]" by Christopher C. Stacy
Christopher C. Stacy  
View profile  
 More options Jun 29 2002, 1:34 am
Newsgroups: comp.lang.lisp
From: cst...@grant.org (Christopher C. Stacy)
Date: Sat, 29 Jun 2002 05:34:57 GMT
Local: Sat, Jun 29 2002 1:34 am
Subject: Re: Cluster CL [Was: Upper limits of CL]

>>>>> On 28 Jun 2002 19:58:04 -0700, Joel Ray Holveck ("Joel") writes:

 >>> Besides, if you really need gigabyte upon gigabyte of memory
 >>> and the hardware to utilize it, the only thing between you and
 >>> satisfying that need has been money for at least 10 years.
 >> Exactly so, see:
 >> <URL:http://www.sgi.com/origin/3000/>
 >> <URL:http://www.sgi.com/products/storage/9400.html>
 Joel> [snip]
 >> Unfortunately(?), applications that make effective *use* of all that
 >> horsepower at once in a single program tend to be written in Fortran
 >> (usually with OpenMP or MPI), not Common Lisp.

 Joel> I've had a hard time finding CLs for cluster computing.  Does anybody
 Joel> know if this sort of thing was ever developed as a product?

Sometimes "comp.lang.lisp" looks like a "cluster-CL".


 
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.
Carl Shapiro  
View profile  
 More options Jun 29 2002, 8:54 am
Newsgroups: comp.lang.lisp
From: Carl Shapiro <cshapiro+s...@panix.com>
Date: 29 Jun 2002 08:54:44 -0400
Local: Sat, Jun 29 2002 8:54 am
Subject: Re: Cluster CL [Was: Upper limits of CL]
Joel Ray Holveck <jo...@juniper.net> writes:

> >> Besides, if you really need gigabyte upon gigabyte of memory
> >> and the hardware to utilize it, the only thing between you and
> >> satisfying that need has been money for at least 10 years.
> > Exactly so, see:
> >       <URL:http://www.sgi.com/origin/3000/>
> >       <URL:http://www.sgi.com/products/storage/9400.html>
> [snip]
> > Unfortunately(?), applications that make effective *use* of all that
> > horsepower at once in a single program tend to be written in Fortran
> > (usually with OpenMP or MPI), not Common Lisp.

> I've had a hard time finding CLs for cluster computing.  Does anybody
> know if this sort of thing was ever developed as a product?

Yes.  Ask Google about either MPI and Lisp or PVM and Lisp.

 
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.
Petter Gustad  
View profile  
 More options Jul 4 2002, 2:07 am
Newsgroups: comp.lang.lisp
From: Petter Gustad <newsmailco...@gustad.com>
Date: Thu, 04 Jul 2002 06:07:26 GMT
Local: Thurs, Jul 4 2002 2:07 am
Subject: Re: Cluster CL [Was: Upper limits of CL]
Joel Ray Holveck <jo...@juniper.net> writes:

> >> Besides, if you really need gigabyte upon gigabyte of memory
> >> and the hardware to utilize it, the only thing between you and
> >> satisfying that need has been money for at least 10 years.
> > Exactly so, see:
> >       <URL:http://www.sgi.com/origin/3000/>
> >       <URL:http://www.sgi.com/products/storage/9400.html>
> [snip]
> > Unfortunately(?), applications that make effective *use* of all that
> > horsepower at once in a single program tend to be written in Fortran
> > (usually with OpenMP or MPI), not Common Lisp.

> I've had a hard time finding CLs for cluster computing.  Does anybody
> know if this sort of thing was ever developed as a product?

Try to take a look at NetCLOS at:
http://lki-www.informatik.uni-hamburg.de/~hotz/homepage.html

Petter
--
________________________________________________________________________
Petter Gustad   8'h2B | (~8'h2B) - Hamlet in Verilog   http://gustad.com


 
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.
End of messages < Older 
« Back to Discussions « Newer topic     Older topic »