- Practice
- About 15 min
- 5 practice questions
Liquidity in real-time gross settlement: queues and gridlock
Explain why gross real-time settlement needs liquidity, trace payments through a queue in the right order, recognise gridlock and show how simultaneous offsetting releases it.
If something looks wrong, please tell us.
Real-time gross settlement is the safest way for banks to pay each other, because each payment becomes final as soon as it settles. Its price is liquidity: every payment must be fully funded at the moment it settles. This lesson works through what happens when funds are short, using small invented balances, so that you can answer questions on queues, gridlock and how systems release it.
Full or nothing, and the queue
In a gross system a payment is settled in full or not at all. If a bank's settlement account cannot cover a payment, the payment does not settle in part; it waits in a queue. As other banks' payments arrive, the balance rises and queued payments are released. A bank's liquidity during the day therefore comes from its opening balance, its incoming payments and any funds it can borrow for the day; central banks commonly provide intraday liquidity to participants against collateral. This course gives no figures for such facilities.
Gridlock
Sometimes every bank is waiting for another. Bank A can pay only if it receives from C; C only if it receives from B; B only if it receives from A. Each payment on its own is unfundable, so nothing moves. This is gridlock. Yet the banks together may hold enough to settle everything if the payments are settled simultaneously, because the incoming and outgoing amounts offset. Systems therefore include mechanisms that look across the queue and settle a set of payments together when every bank's resulting balance would be non-negative.
A queued set can be settled together if, for every bank, opening balance + incoming − outgoing is not negative. Total funds in the system never change; they only move.
Worked example 1: breaking a gridlock
Suppose Bank A has ₹50 crore and must pay B ₹80 crore; B has ₹30 crore and must pay C ₹70 crore; C has ₹20 crore and must pay A ₹60 crore. Can any payment settle on its own? Can all three settle together? Working: on its own, A needs 80 but has 50; B needs 70 but has 30; C needs 60 but has 20. None can settle: gridlock. Together: A = 50 − 80 + 60 = 30; B = 30 + 80 − 70 = 40; C = 20 + 70 − 60 = 30. All are non-negative. Check: 30 + 40 + 30 = 100 = 50 + 30 + 20. Answer: none alone, but all three together, leaving A ₹30 crore, B ₹40 crore and C ₹30 crore.
Worked example 2: finding the order
Suppose P has ₹40 crore and must pay Q ₹70 crore; Q has ₹20 crore and must pay R ₹50 crore; R has ₹60 crore and must pay P ₹30 crore. Payments settle one at a time. In what order can all three settle? Working: test each payment as a first move. P to Q needs 70, P has 40: no. Q to R needs 50, Q has 20: no. R to P needs 30, R has 60: yes. After it, R has 30 and P has 70. Now P to Q (70) can settle: P 0, Q 90. Then Q to R (50): Q 40, R 80. Answer: R to P, then P to Q, then Q to R. Final balances P 0, Q 40, R 80, which add to the original 120.
The method is mechanical: at each step, list the payments whose payer can fund them now, settle one, update balances, repeat. If at some point no payment can be funded alone, test whether the remaining set can be settled together by offsetting.
Why this matters for policy
These mechanics explain why gross systems are used for large and urgent payments, where safety matters most, and why such systems pay attention to liquidity management. They also explain the attraction of net systems for small, numerous payments: a net system needs only the final differences, so the gridlock problem largely disappears, at the cost of exposure until settlement, which the next lesson examines.
Key takeaways: in gross settlement each payment is funded in full or queued; liquidity comes from balances, incoming payments and any intraday borrowing; gridlock is a circular wait; offsetting settles a set together when every resulting balance is non-negative; and total funds are conserved, which is a quick check on any answer.
Check your understanding
-
1. In RTGS, a bank's settlement account does not hold enough funds for an outgoing payment. What normally happens to the payment?
- It waits in a queue until enough funds arrive
- It is settled in part, for whatever balance is available
- It is moved to NEFT automatically
- It is settled anyway, leaving the account negative without limit
Show answer
Answer: A. RTGS settles each payment in full or not at all; a payment that cannot be funded waits in the queue until funds come in.
-
2. What is 'gridlock' in a real-time gross settlement system?
- A situation where banks' payments are all queued because each is waiting for incoming funds from another
- A fault that stops customer cards working
- A rule that sets fixed batch times
- The final irrevocable settlement of a payment
Show answer
Answer: A. Gridlock is a circular wait: each bank could pay if it first received, but none can go first.
-
3. Suppose Bank M has ₹25 crore and owes Bank N ₹40 crore; Bank N has ₹10 crore and owes M ₹30 crore. Both payments are settled together by offsetting. What is M's balance afterwards?
- −₹15 crore
- ₹25 crore
- ₹55 crore
- ₹15 crore
Show answer
Answer: D. M: 25 − 40 + 30 = 15. N: 10 + 40 − 30 = 20. Both are non-negative, so offsetting can settle both. Total funds 35 are unchanged.
-
4. Which of these adds funds to a bank's RTGS settlement account during the day?
- Sending more payments to other banks
- Placing its outgoing payments in the queue
- Accepting more cheques from its own customers for later clearing
- Receiving payments from other banks
Show answer
Answer: D. Incoming payments add to the balance. Sending payments reduces it; queueing changes nothing; cheques are cleared later through a net system.
-
5. Suppose X has ₹10 crore and owes Y ₹30 crore; Y has ₹50 crore and owes Z ₹40 crore; Z has nothing and owes X ₹20 crore. Settling one payment at a time, which payment can settle first?
- X to Y
- Z to X
- Y to Z
- None; the system is gridlocked
Show answer
Answer: C. Only Y has enough to pay first (50 ≥ 40). Then Z (now 40) pays X 20, and X (now 30) pays Y 30; all settle.
Sign in to keep track of the lessons you finish.