This looks very interesting. Should we add it to the core
distribution?
Excellent question. As yet I have received very little feedback on it,
though it does work as advertised. I have had some people complain
that
while they'd like to use it (especially the timestamp-that-remembers-
the-ti
Your main example seems to focus on a large table where a key
column has
constrained values. This case is interesting in proportion to the
number of possible values. If I have billions of rows, each
having one
of only two values, I can think of a trivial and very fast method of
returning th
On most platforms it's quite unlikely that any memory would
actually get
released back to the OS before transaction end, because the memory
blocks belonging to the tuplesort context will be intermixed with
blocks
belonging to other contexts. So I think this is pretty pointless.
(If you can't
[skip]
happening in the bgwriter's inner loop. Even more to the point, you
can't do such changes without getting a superexclusive lock on the
page
(not only locked, but no one else has it pinned), which is a real
nonstarter for the bgwriter, both for performance and possible
deadlock
iss
Pailloncy Jean-Gerard wrote:
You should have a look to this thread
http://archives.postgresql.org/pgsql-hackers/2005-02/msg00263.php
Take a look at this paper about "lock-free parallel hash table"
http://www.cs.rug.nl/~wim/mechver/hashtable/
Is this relevant? Hash indexes are on
Le 2 mars 05, à 21:17, Hannu Krosing a écrit :
Ühel kenal päeval (teisipäev, 1. märts 2005, 14:54-0500), kirjutas
[EMAIL PROTECTED]:
Now, it occurs to me that if my document reference table can refer to
something other than an indexed primary key, I can save a lot of index
processing time in Postgr
What operations does 2Q require on the shared lists? (Assuming that's
the replacement policy we're going with.) Depending on how complex the
list modifications are, non-blocking algorithms might be worth
considering. For example, to remove a node from the middle of a linked
list can be done via ato
Hi,
There is better than lock-free algorithm, this is wait-free.
A lock-free algorithm guarantees progress regardless of whether some
processes are delayed or even killed and regardless of scheduling
policies. By definition, a lock-free object must be immune to deadlock
and livelock.
A wait-free
I live in Europe, and right now, the patent, if granted, would not
have any effect on me. Even if Europe will have patents on software, I
doubt that this ARC algorithm will be patentable in Europe.
Is it possible to have an abstraction api where we can plug different
algorithms.
With two plugins
This is a very important thread. Many thanks to Jean-Gerard for
bringing
the community's attention to this.
Thanks Simon.
I was working during my PhD on some parallel algorithm. The computer
was a 32-grid processor in 1995. In this architecture we need to do the
lock on the data, with minimum co
Here is some pretty good info on lock-free structures... I'm pretty
sure I tested their code in a multithreaded high-concurrency
environment and experienced the problems I was discussing.
I understand.
The algorithm is quite complex.
The old version was not really fast.
In the paper cited, some t
Hi,
I read recently a paper
Keir Fraser & Tim Harris, Concurrent Programing without Locks, ACM
Journal Name, vol V, n° N, M 20YY, Page 1-48
About algorithm to manage structure (exemple about red-black tree, skip
list) with dead-lock free property, parallel read, etc.
Does this have been studied
12 matches
Mail list logo
