r3wp [groups: 83 posts: 189283]
  • Home
  • Script library
  • AltME Archive
  • Mailing list
  • Articles Index
  • Site search
 

World: r3wp

[!REBOL3-OLD1]

Henrik
22-Jan-2009
[10012]
ok, I'll find it again.
Steeve
22-Jan-2009
[10013]
ahah...
Henrik
22-Jan-2009
[10014x2]
http://hmkdesign.dk/rebol/r3/idx.r
I'll post on rebdev too.
Pavel
22-Jan-2009
[10016]
THNX 2 U both
Steeve
22-Jan-2009
[10017]
ok, thanks
BrianH
22-Jan-2009
[10018]
I would not currently assume that tasks will eventally correspond 
to threads at all, green or not. They might switch to the microprocess 
model. In any case we'll try to pick the best strategy for REBOL.
Steeve
22-Jan-2009
[10019x2]
In the french BSS, Carl said that the tasks will not use threads.
*BBS
BrianH
22-Jan-2009
[10021]
Yeah, threads have been discredited somewhat in the research community 
lately. Perhaps we could go all out with an Erlang-style green process 
model? That would be fun :)
Henrik
22-Jan-2009
[10022]
The current public alpha uses OS threads, doesn't it?
BrianH
22-Jan-2009
[10023x2]
And crashes them.
Almost-public :)
Steeve
22-Jan-2009
[10025]
Brian, could you create a sub header in R3/protocols for the virtual 
block scheme ?
BrianH
22-Jan-2009
[10026]
Sure.
Steeve
22-Jan-2009
[10027x2]
and move all related msg please (Argh...) :)
Oh... excuse me Henrik, you requested it and you could do that too...
BrianH
22-Jan-2009
[10029]
Done.
Henrik
22-Jan-2009
[10030]
Steeve, I couldn't find how to in help, so I just asked. :-)
BrianH
22-Jan-2009
[10031]
Public messages moved. I'll move the private messages when I figure 
out how to list them.
Steeve
22-Jan-2009
[10032x4]
[VBS] Humm, as i stated, performances are bad currently with append, 
it took 1 minute to add 10000 values (166 values by second).
[VBS] But to fetch 10000 values randomly, it took only 0.01 sec (fast)
[VBS] Did you realize that 1 000 000 values can be fetched in a loop 
without bloating the memory in only 1 SEC
[VBS] SORRY, i made a wrong read, it took 1 sec to fetch 10 000 values 
not 1 000 000 but it's quite good too, no ?       -_-'
Janko
22-Jan-2009
[10036x2]
@BrianH : What are microprocesses ? you mean something like very 
lightweight processes that don't share common memory?
(lightweing in sense that they can be created and destroyed quickly 
and that there can be many of them)
[unknown: 5]
22-Jan-2009
[10038]
Steeve, your performance measurements are about dead on with what 
Tretbase performance is.
Henrik
22-Jan-2009
[10039]
http://www.rebol.net/cgi-bin/rebdev-web.r?msg=577
[unknown: 5]
22-Jan-2009
[10040]
Here is a fetch of 10,000 records:

>> s: now/precise db/get test d t: now/precise
== 22-Jan-2009/12:13:34.534-6:00
>> difference t s
== 0:00:00.973


Pretty much about  1 second - similiar to what your seeing.  I don't 
think we can get much more performance out of REBOL than that.
Janko
22-Jan-2009
[10041]
Paul: is tretbase already intended for use or still in development?
[unknown: 5]
22-Jan-2009
[10042x2]
It is still in development Janko but progressing.
Tretbase is going to be ported to C though.
Janko
22-Jan-2009
[10044x2]
to C, interesting
this is maybe a good idea to develop something in gihert level language 
to figure out all bits and pieces and algoritms, and then when you 
have a good picture port it into c
Steeve
22-Jan-2009
[10046]
Paul, in fact i had the same result than you, i wrote 1 sec to give 
an arround :)
Janko
22-Jan-2009
[10047]
gihrt = higher
[unknown: 5]
22-Jan-2009
[10048x2]
Yeah I figured that Steeve.
Janko, the problem is that REBOL at least in R2 doesn't give us the 
control of memory and such as I would like.
Steeve
22-Jan-2009
[10050]
did you try 10 000 random access ? is was in that case
[unknown: 5]
22-Jan-2009
[10051x5]
Here is the total experience I did Steeve:

>> d: []
== []
>> loop 10000 [append d random 100000]

== [33695 15852 80380 7196 57367 71232 73853 47912 70304 20415 65171 
70632 77767 89530 45257 65786 34935
 70620 90566 92441 23445 26...
>> db/get test d

== [[44 #{00000354} [paul tretter 41]] [45 #{00000368} [paul tretter 
41]] [46 #{0000037C} [paul tretter
41]] [55 #{00000430} [paul ...
>> s: now/precise db/get test d t: now/precise
== 22-Jan-2009/12:13:34.534-6:00
>> difference t s
== 0:00:00.973
Notice my records are only three fields each.
Obviously the size of the record will impact the timing.
But mine is also returning not just the whole record but also the 
change id tag.
Steeve, don't let Carl's promise of RIF stop you from working on 
VBS.  I have heard that promise for years  now.
Steeve
22-Jan-2009
[10056]
Hum currently, it's a problem for me, he said that his RIF conception 
have better perfs than VBS.

He said too that i  have not done the best choices (missing cache 
for example).

He said too than doing such a scheme is complex (beyond my understanding 
???)

I don"t want to work on a thing which will be uselless when R3 will 
be released.
He said better perfs with RIF, so RIF works currently...
I wonder why rebdev is not using it...
I'm a little bit disapointed...
[unknown: 5]
22-Jan-2009
[10057x3]
I think we just don't know all the capabilities that we can harness 
with REBOL.  Regarding caching, I know that you have to tune how 
much you send to a read/write request for optimal port usage.  Carl 
is going to know the underlying details better than we would.
But the real attribute that we would need to take advantage of is 
registers and we can't do that.
At least not that has been published as far as I know.
Janko
22-Jan-2009
[10060]
hm.. I would be a little disapointed to :(  ... but when will RIF 
be available then.. isn't time in general problem with RT
Henrik
22-Jan-2009
[10061]
RIF is not going to come right now. That is probably a feature for 
3.1.