postgresql/src/backend/storage/ipc
Tom Lane ec0baf949e Divide the lock manager's shared state into 'partitions', so as to
reduce contention for the former single LockMgrLock.  Per my recent
proposal.  I set it up for 16 partitions, but on a pgbench test this
gives only a marginal further improvement over 4 partitions --- we need
to test more scenarios to choose the number of partitions.
2005-12-11 21:02:18 +00:00
..
ipc.c Re-run pgindent, fixing a problem where comment lines after a blank 2005-11-22 18:17:34 +00:00
ipci.c Simplify lock manager data structures by making a clear separation between 2005-12-09 01:22:04 +00:00
Makefile Split the shared-memory array of PGPROC pointers out of the sinval 2005-05-19 21:35:48 +00:00
pmsignal.c Standard pgindent run for 8.1. 2005-10-15 02:49:52 +00:00
procarray.c Divide the lock manager's shared state into 'partitions', so as to 2005-12-11 21:02:18 +00:00
README $Header: -> $PostgreSQL Changes ... 2003-11-29 19:52:15 +00:00
shmem.c Re-run pgindent, fixing a problem where comment lines after a blank 2005-11-22 18:17:34 +00:00
shmqueue.c Tag appropriate files for rc3 2004-12-31 22:04:05 +00:00
sinval.c Re-run pgindent, fixing a problem where comment lines after a blank 2005-11-22 18:17:34 +00:00
sinvaladt.c Standard pgindent run for 8.1. 2005-10-15 02:49:52 +00:00

$PostgreSQL: pgsql/src/backend/storage/ipc/README,v 1.4 2003/11/29 19:51:56 pgsql Exp $
Mon Jul 18 11:09:22 PDT 1988  W.KLAS

Cache invalidation synchronization routines:
===========================================

The cache synchronization is done using a message queue. Every
backend can register a message which then has to be read by
all backends. A message read by all backends is removed from the 
queue automatically. If a message has been lost because the buffer
was full, all backends that haven't read this message will be
told that they have to reset their cache state. This is done
at the time when they try to read the message queue.

The message queue is implemented as a shared buffer segment. Actually,
the queue is a circle to allow fast inserting, reading (invalidate data) and
maintaining the buffer.