and pointer
to global structures for each subsection. Each subsection can define
its own globals
structure and register them with the hashtable. This would not impact
readablity and
make the gobal environment easy to copy. IMHO, this is possible with
minimal performance
impact.
Myron Scott
[EMAIL
. This
was and seems to still be the major drawback to using threads.
Myron Scott
[EMAIL PROTECTED]
---(end of broadcast)---
TIP 5: Have you checked our extensive FAQ?
http://www.postgresql.org/users-lounge/docs/faq.html
But note that Myron did a number of things that are (IMHO) orthogonal
yes, I did :)
to process-to-thread conversion, such as adding prepared statements,
a separate thread/process/whateveryoucallit for buffer writing, ditto
for vacuuming, etc. I think his results cannot be taken as
scan.
A very crude, simple test but I think it shows some promise.
I know I used threads but you could probably just as easily use a slave
process
and pass ItemPointers via pipes or shared memory.
Thanks,
Myron Scott
---(end of broadcast
On Apr 8, 2006, at 10:29 PM, Luke Lonergan wrote:
Myron,
First, this sounds really good!
On 4/8/06 9:54 PM, Myron Scott [EMAIL PROTECTED] wrote:
I added a little hack to the buffer
code to force
pages read into the buffer to stay at the back of the free buffer
list
until the master
On Apr 9, 2006, at 9:26 AM, Martijn van Oosterhout wrote:
On Sun, Apr 09, 2006 at 08:23:36AM -0700, Myron Scott wrote:
This is the part I'm curious about - is this using the
shared_buffers region
in a circular buffer fashion to store pre-fetched pages?
Yes. That is basically what the slave
something in this analysis?
I've attached my dtrace script.
Myron Scott
#!/usr/sbin/dtrace -s
pid$1::ExecInitSeqScan:entry
{
ts = timestamp;
vts = vtimestamp;
timeon = 1;
}
pid$1::ExecEndSeqScan:return
/ts/
{
printf(scan time %d,(timestamp - ts) /100) ;
@val
On Tue, 2006-04-11 at 07:47, Myron Scott wrote:
client
or additional processing. Am I missing something in this analysis?
I've attached my dtrace script.
To answer my own question, I suppose my processors are
relatively slow compared to most setups.
Myron Scott
to generate threadsafe code as well. I use it as a
linked library with my own fe-be protocol. This ended up being much much
more than I bargained for and looking back would probably not have tried
had I known any better.
Myron Scott
On Mon, 27 Nov 2000, Junfeng Zhang wrote:
Hello all,
I am
I would love to distribute this code to anybody who wants it. Any
suggestions for a good place? However, calling the
work a code redesign is a bit generous. This was more like a
brute force hack. I just moved all the connection related global
variables to
a thread local "environment variable"
For anyone interested,
I have posted my multi-threaded version of PostgreSQL here.
http://www.sacadia.com/mtpg.html
It is based on 7.0.2 and the TAO CORBA ORB which is here.
http://www.cs.wustl.edu/~schmidt/TAO.html
Myron Scott
[EMAIL PROTECTED]
spinlocks rewritten to mutex_
locktable uses sema_
some cond_ in bufmgr.c
Myron
Karel Zak wrote:
On Mon, 1 Jan 2001, Myron Scott wrote:
For anyone interested,
I have posted my multi-threaded version of PostgreSQL here.
http://www.sacadia.com/mtpg.html
How you solve locks
side
of the JNI interface yet but the C++ side is there.
It's still not stable but it is much better than
the last.
Myron Scott
[EMAIL PROTECTED]
parts of the codebase.
Myron Scott
---(end of broadcast)---
TIP 1: subscribe and unsubscribe commands go to [EMAIL PROTECTED]
is available if it's of any help.
http://weaver2.dev.java.net
Myron Scott
On Oct 20, 2008, at 11:28 PM, Chuck McDevitt wrote:
There is a problem trying to make Postgres do these things in
Parallel.
The backend code isn’t thread-safe, so doing a multi-thread
implementation requires quite
15 matches
Mail list logo
