shm_broadcast.py 23.5 KB
Newer Older
1
2
# SPDX-License-Identifier: Apache-2.0

3
import os
4
import pickle
5
import sys
6
7
import time
from contextlib import contextmanager
8
from dataclasses import dataclass, field
9
from multiprocessing import shared_memory
10
11
from threading import Event
from typing import Any, List, Optional, Tuple, Union
12
13
14
15
from unittest.mock import patch

import torch
import torch.distributed as dist
16
import zmq
17
from torch.distributed import ProcessGroup
18
from zmq import IPV6  # type: ignore
19
from zmq import SUB, SUBSCRIBE, XPUB, XPUB_VERBOSE, Context  # type: ignore
20
21

import vllm.envs as envs
22
from vllm.distributed.utils import StatelessProcessGroup
23
from vllm.logger import init_logger
24
25
from vllm.utils import (get_ip, get_open_port, get_open_zmq_ipc_path,
                        is_valid_ipv6_address)
26
27
28
29
30

VLLM_RINGBUFFER_WARNING_INTERVAL = envs.VLLM_RINGBUFFER_WARNING_INTERVAL

logger = init_logger(__name__)

31
32
33
34
35
36
37
38
39
40
41
42
43
44
# We prefer to use os.sched_yield as it results in tighter polling loops,
# measured to be around 3e-7 seconds. However on earlier versions of Python
# os.sched_yield() does not release the GIL, so we fall back to time.sleep(0)
USE_SCHED_YIELD = ((sys.version_info[:3] >= (3, 11, 1))
                   or (sys.version_info[:2] == (3, 10)
                       and sys.version_info[2] >= 8))


def sched_yield():
    if USE_SCHED_YIELD:
        os.sched_yield()
    else:
        time.sleep(0)

45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76

class ShmRingBuffer:

    def __init__(self,
                 n_reader: int,
                 max_chunk_bytes: int,
                 max_chunks: int,
                 name: Optional[str] = None):
        """
        A shared memory ring buffer implementation for broadcast communication.
        Essentially, it is a queue where only one will `enqueue` and multiple
        will `dequeue`. The max size of each item, together with the max number
        of items that can be stored in the buffer are known in advance.
        In this case, we don't need to synchronize the access to
         the buffer.
        
        Buffer memory layout:
                  data                                 metadata
                    |                                      |
                    | (current_idx)                        | (current_idx)
                    v                                      v
        +-------------------------------+----------------------------------------+
        | chunk0 | chunk1 | ... | chunk | metadata0 | metadata1 | ... | metadata |
        +-------------------------------+----------------------------------------+
        | max_chunks x max_chunk_bytes  | max_chunks x (1 + n_reader) bytes      |

        metadata memory layout: each byte is a flag, the first byte is the written
        flag, and the rest are reader flags. The flags are set to 0 by default.
        +--------------+--------------+--------------+-----+--------------+
        | written_flag | reader0_flag | reader1_flag | ... | readerN_flag |
        +--------------+--------------+--------------+-----+--------------+

77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
        The state of metadata is as follows:

        (case 1) 0???...???: the block is not written yet, cannot read, can write
        (case 2) 1000...000: the block is just written, can read, cannot write
        (case 3) 1???...???: the block is written and read by some readers, can read if not read, cannot write
        (case 4) 1111...111: the block is written and read by all readers, cannot read, can write

        State transition for readers:

        When a reader finds a block that it can read (case 2 or 3), it can yield the block for caller to read.
        Only after the caller finishes reading the block, the reader can mark the block as read.
        Readers only mark the block as read (from 0 to 1), the writer marks the block as ready to read (from 1 to 0).

        State transition for writer:

        When the writer writes to a block (case 1 or 4), it first resets the written flag to 0, converting either case
        to case 1. Then it can yield the block for caller to write. After the caller finishes writing the block, the writer
        can reset the reader flags to 0, and mark the block as written (from 0 to 1).
        NOTE: the order is important here, first reset the reader flags (so that we are still in case 1), then mark the block as written. The state transition is atomic. If we do it in the reverse order, it will go through case 3 and then back to case 2, and readers might read the intermediate case 3, which is not correct.

97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
        During creation, `name` is None and the buffer is created. We can pass the
        created object to other processes by pickling it. The other processes will
        get the name of the shared memory and open it, so that they can access the
        same shared memory buffer.
        """# noqa
        self.n_reader = n_reader
        self.metadata_size = 1 + n_reader
        self.max_chunk_bytes = max_chunk_bytes
        self.max_chunks = max_chunks
        self.total_bytes_of_buffer = (self.max_chunk_bytes +
                                      self.metadata_size) * self.max_chunks
        self.data_offset = 0
        self.metadata_offset = self.max_chunk_bytes * self.max_chunks

        if name is None:
            # we are creating a buffer
            self.is_creator = True
            self.shared_memory = shared_memory.SharedMemory(
                create=True, size=self.total_bytes_of_buffer)
            # initialize the metadata section to 0
            with memoryview(self.shared_memory.buf[self.metadata_offset:]
                            ) as metadata_buffer:
                torch.frombuffer(metadata_buffer, dtype=torch.uint8).fill_(0)
        else:
            # we are opening an existing buffer
            self.is_creator = False
            # fix to https://stackoverflow.com/q/62748654/9191338
            # Python incorrectly tracks shared memory even if it is not
            # created by the process. The following patch is a workaround.
            with patch("multiprocessing.resource_tracker.register",
                       lambda *args, **kwargs: None):
128
129
                try:
                    self.shared_memory = shared_memory.SharedMemory(name=name)
130
131
132
133
134
135
136
                    # See https://docs.python.org/3/library/multiprocessing.shared_memory.html # noqa
                    # Some platforms allocate memory based on page size,
                    # so the shared memory block size may be larger or equal
                    # to the requested size. The size parameter is ignored
                    # when attaching to an existing block.
                    assert (self.shared_memory.size
                            >= self.total_bytes_of_buffer)
137
138
139
140
141
                except FileNotFoundError:
                    # we might deserialize the object in a different node
                    # in this case, this object is not used,
                    # and we should suppress the error
                    pass
142

143
144
145
146
    def handle(self):
        return (self.n_reader, self.max_chunk_bytes, self.max_chunks,
                self.shared_memory.name)

147
148
149
    def __reduce__(self):
        return (
            self.__class__,
150
            self.handle(),
151
152
153
        )

    def __del__(self):
154
155
156
157
        if hasattr(self, "shared_memory"):
            self.shared_memory.close()
            if self.is_creator:
                self.shared_memory.unlink()
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173

    @contextmanager
    def get_data(self, current_idx: int):
        start = self.data_offset + current_idx * self.max_chunk_bytes
        end = start + self.max_chunk_bytes
        with memoryview(self.shared_memory.buf[start:end]) as buf:
            yield buf

    @contextmanager
    def get_metadata(self, current_idx: int):
        start = self.metadata_offset + current_idx * self.metadata_size
        end = start + self.metadata_size
        with memoryview(self.shared_memory.buf[start:end]) as buf:
            yield buf


174
175
176
@dataclass
class Handle:
    local_reader_ranks: List[int] = field(default_factory=list)
177

178
    buffer_handle: Optional[Tuple[int, int, int, str]] = None
179
180
181
    local_subscribe_addr: Optional[str] = None
    remote_subscribe_addr: Optional[str] = None
    remote_addr_ipv6: bool = False
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211


class MessageQueue:

    def __init__(
        self,
        n_reader,  # number of all readers
        n_local_reader,  # number of local readers through shared memory
        local_reader_ranks: Optional[List[int]] = None,
        max_chunk_bytes: int = 1024 * 1024 * 10,
        max_chunks: int = 10,
        connect_ip: Optional[str] = None,
    ):
        if local_reader_ranks is None:
            local_reader_ranks = list(range(n_local_reader))
        else:
            assert len(local_reader_ranks) == n_local_reader
        self.n_local_reader = n_local_reader
        n_remote_reader = n_reader - n_local_reader
        self.n_remote_reader = n_remote_reader

        context = Context()

        if n_local_reader > 0:
            # for local readers, we will:
            # 1. create a shared memory ring buffer to communicate small data
            # 2. create a publish-subscribe socket to communicate large data
            self.buffer = ShmRingBuffer(n_local_reader, max_chunk_bytes,
                                        max_chunks)

212
213
214
215
216
217
218
219
            # XPUB is very similar to PUB,
            # except that it can receive subscription messages
            # to confirm the number of subscribers
            self.local_socket = context.socket(XPUB)
            # set the verbose option so that we can receive every subscription
            # message. otherwise, we will only receive the first subscription
            # see http://api.zeromq.org/3-3:zmq-setsockopt for more details
            self.local_socket.setsockopt(XPUB_VERBOSE, True)
220
221
222
            local_subscribe_addr = get_open_zmq_ipc_path()
            logger.debug("Binding to %s", local_subscribe_addr)
            self.local_socket.bind(local_subscribe_addr)
223
224
225
226

            self.current_idx = 0
        else:
            self.buffer = None  # type: ignore
227
            local_subscribe_addr = None
228
229
230
            self.local_socket = None
            self.current_idx = -1

231
        remote_addr_ipv6 = False
232
233
234
        if n_remote_reader > 0:
            # for remote readers, we will:
            # create a publish-subscribe socket to communicate large data
235
236
            if not connect_ip:
                connect_ip = get_ip()
237
238
            self.remote_socket = context.socket(XPUB)
            self.remote_socket.setsockopt(XPUB_VERBOSE, True)
239
            remote_subscribe_port = get_open_port()
240
241
            if is_valid_ipv6_address(connect_ip):
                self.remote_socket.setsockopt(IPV6, 1)
242
                remote_addr_ipv6 = True
243
                connect_ip = f"[{connect_ip}]"
244
245
            socket_addr = f"tcp://*:{remote_subscribe_port}"
            self.remote_socket.bind(socket_addr)
246
            remote_subscribe_addr = f"tcp://{connect_ip}:{remote_subscribe_port}"
247
        else:
248
            remote_subscribe_addr = None
249
250
251
252
253
254
255
256
257
258
            self.remote_socket = None

        self._is_writer = True
        self._is_local_reader = False
        self.local_reader_rank = -1
        # rank does not matter for remote readers
        self._is_remote_reader = False

        self.handle = Handle(
            local_reader_ranks=local_reader_ranks,
259
260
            buffer_handle=self.buffer.handle()
            if self.buffer is not None else None,
261
262
263
            local_subscribe_addr=local_subscribe_addr,
            remote_subscribe_addr=remote_subscribe_addr,
            remote_addr_ipv6=remote_addr_ipv6,
264
265
        )

266
267
        logger.info("vLLM message queue communication handle: %s", self.handle)

268
269
270
271
272
273
274
275
276
277
278
279
    def export_handle(self) -> Handle:
        return self.handle

    @staticmethod
    def create_from_handle(handle: Handle, rank) -> "MessageQueue":
        self = MessageQueue.__new__(MessageQueue)
        self.handle = handle
        self._is_writer = False

        context = Context()

        if rank in handle.local_reader_ranks:
280
281
            assert handle.buffer_handle is not None
            self.buffer = ShmRingBuffer(*handle.buffer_handle)
282
283
284
285
286
287
288
            self.current_idx = 0
            self.local_reader_rank = handle.local_reader_ranks.index(rank)
            self._is_local_reader = True
            self._is_remote_reader = False

            self.local_socket = context.socket(SUB)
            self.local_socket.setsockopt_string(SUBSCRIBE, "")
289
            socket_addr = handle.local_subscribe_addr
290
291
            logger.debug("Connecting to %s", socket_addr)
            self.local_socket.connect(socket_addr)
292
293
294
295
296
297
298
299
300
301
302
303
304

            self.remote_socket = None
        else:
            self.buffer = None  # type: ignore
            self.current_idx = -1
            self.local_reader_rank = -1
            self._is_local_reader = False
            self._is_remote_reader = True

            self.local_socket = None

            self.remote_socket = context.socket(SUB)
            self.remote_socket.setsockopt_string(SUBSCRIBE, "")
305
            if handle.remote_addr_ipv6:
306
                self.remote_socket.setsockopt(IPV6, 1)
307
            socket_addr = handle.remote_subscribe_addr
308
309
            logger.debug("Connecting to %s", socket_addr)
            self.remote_socket.connect(socket_addr)
310
311
312
313
314
315
316
317
318
319
320
321

        return self

    def wait_until_ready(self):
        """This is a collective operation. All processes (including the
        readers and the writer) should call this function.
        """
        if self._is_writer:
            # wait for all readers to connect

            # local readers
            for i in range(self.n_local_reader):
322
323
                # wait for subscription messages from all local readers
                self.local_socket.recv()
324
            if self.n_local_reader > 0:
325
326
                # send a message to all local readers
                # to make sure the publish channel is working
327
328
329
330
                self.local_socket.send(b"READY")

            # remote readers
            for i in range(self.n_remote_reader):
331
332
                # wait for subscription messages from all remote readers
                self.remote_socket.recv()
333
            if self.n_remote_reader > 0:
334
335
                # send a message to all remote readers
                # to make sure the publish channel is working
336
337
                self.remote_socket.send(b"READY")
        elif self._is_local_reader:
338
            # wait for the writer to send a message
339
340
341
            recv = self.local_socket.recv()
            assert recv == b"READY"
        elif self._is_remote_reader:
342
            # wait for the writer to send a message
343
344
            recv = self.remote_socket.recv()
            assert recv == b"READY"
345
346

    @contextmanager
347
    def acquire_write(self, timeout: Optional[float] = None):
348
        assert self._is_writer, "Only writers can acquire write"
349
        start_time = time.monotonic()
350
351
352
353
354
355
356
        n_warning = 1
        while True:
            with self.buffer.get_metadata(self.current_idx) as metadata_buffer:
                read_count = sum(metadata_buffer[1:])
                written_flag = metadata_buffer[0]
                if written_flag and read_count != self.buffer.n_reader:
                    # this block is written and not read by all readers
357
358
359
360
                    # for writers, `self.current_idx` is the next block to write
                    # if this block is not ready to write,
                    # we need to wait until it is read by all readers

361
                    # Release the processor to other threads
362
                    sched_yield()
363

364
                    # if we wait for a long time, log a message
365
366
                    if (time.monotonic() - start_time
                            > VLLM_RINGBUFFER_WARNING_INTERVAL * n_warning):
367
368
369
370
371
                        logger.debug(
                            ("No available shared memory broadcast block found"
                             " in %s second."),
                            VLLM_RINGBUFFER_WARNING_INTERVAL,
                        )
372
373
                        n_warning += 1

374
375
376
377
378
                    # if we time out, raise an exception
                    if (timeout is not None
                            and time.monotonic() - start_time > timeout):
                        raise TimeoutError

379
380
381
382
383
384
385
386
387
388
389
390
                    continue
                # found a block that is either
                # (1) not written
                # (2) read by all readers

                # mark the block as not written
                metadata_buffer[0] = 0
                # let caller write to the buffer
                with self.buffer.get_data(self.current_idx) as buf:
                    yield buf

                # caller has written to the buffer
391
392
393
394
                # NOTE: order is important here
                # first set the read flags to 0
                # then set the written flag to 1
                # otherwise, the readers may think they already read the block
395
396
397
                for i in range(1, self.buffer.n_reader + 1):
                    # set read flag to 0, meaning it is not read yet
                    metadata_buffer[i] = 0
398
399
                # mark the block as written
                metadata_buffer[0] = 1
400
401
                self.current_idx = (self.current_idx +
                                    1) % self.buffer.max_chunks
402
403
404
                break

    @contextmanager
405
406
407
    def acquire_read(self,
                     timeout: Optional[float] = None,
                     cancel: Optional[Event] = None):
408
        assert self._is_local_reader, "Only readers can acquire read"
409
        start_time = time.monotonic()
410
411
412
        n_warning = 1
        while True:
            with self.buffer.get_metadata(self.current_idx) as metadata_buffer:
413
                read_flag = metadata_buffer[self.local_reader_rank + 1]
414
415
416
417
418
                written_flag = metadata_buffer[0]
                if not written_flag or read_flag:
                    # this block is either
                    # (1) not written
                    # (2) already read by this reader
419
420
421
422
423

                    # for readers, `self.current_idx` is the next block to read
                    # if this block is not ready,
                    # we need to wait until it is written

424
                    # Release the processor to other threads
425
                    sched_yield()
426

427
                    # if we wait for a long time, log a message
428
429
                    if (time.monotonic() - start_time
                            > VLLM_RINGBUFFER_WARNING_INTERVAL * n_warning):
430
431
432
433
434
                        logger.debug(
                            ("No available shared memory broadcast block found"
                             "in %s second."),
                            VLLM_RINGBUFFER_WARNING_INTERVAL,
                        )
435
436
                        n_warning += 1

437
438
439
                    if cancel is not None and cancel.is_set():
                        raise RuntimeError("cancelled")

440
441
442
443
444
                    # if we time out, raise an exception
                    if (timeout is not None
                            and time.monotonic() - start_time > timeout):
                        raise TimeoutError

445
446
447
448
449
450
451
452
                    continue
                # found a block that is not read by this reader
                # let caller read from the buffer
                with self.buffer.get_data(self.current_idx) as buf:
                    yield buf

                # caller has read from the buffer
                # set the read flag
453
                metadata_buffer[self.local_reader_rank + 1] = 1
454
455
                self.current_idx = (self.current_idx +
                                    1) % self.buffer.max_chunks
456
457
                break

458
459
    def enqueue(self, obj, timeout: Optional[float] = None):
        """ Write to message queue with optional timeout (in seconds) """
460
461
        assert self._is_writer, "Only writers can enqueue"
        serialized_obj = pickle.dumps(obj, protocol=pickle.HIGHEST_PROTOCOL)
462
463
        if self.n_local_reader > 0:
            if len(serialized_obj) >= self.buffer.max_chunk_bytes:
464
                with self.acquire_write(timeout) as buf:
465
466
467
                    buf[0] = 1  # overflow
                self.local_socket.send(serialized_obj)
            else:
468
                with self.acquire_write(timeout) as buf:
469
470
471
472
                    buf[0] = 0  # not overflow
                    buf[1:len(serialized_obj) + 1] = serialized_obj
        if self.n_remote_reader > 0:
            self.remote_socket.send(serialized_obj)
473

474
475
476
    def dequeue(self,
                timeout: Optional[float] = None,
                cancel: Optional[Event] = None):
477
        """ Read from message queue with optional timeout (in seconds) """
478
        if self._is_local_reader:
479
            with self.acquire_read(timeout, cancel) as buf:
480
481
482
483
484
485
486
                overflow = buf[0] == 1
                if not overflow:
                    # no need to know the size of serialized object
                    # pickle format contains the size information internally
                    # see https://docs.python.org/3/library/pickle.html
                    obj = pickle.loads(buf[1:])
            if overflow:
487
                obj = MessageQueue.recv(self.local_socket, timeout)
488
        elif self._is_remote_reader:
489
            obj = MessageQueue.recv(self.remote_socket, timeout)
490
491
        else:
            raise RuntimeError("Only readers can dequeue")
492
493
        return obj

494
495
496
497
498
499
500
501
    @staticmethod
    def recv(socket: zmq.Socket, timeout: Optional[float]) -> Any:
        timeout_ms = None if timeout is None else int(timeout * 1000)
        if not socket.poll(timeout=timeout_ms):
            raise TimeoutError
        recv = socket.recv(copy=False)
        return pickle.loads(recv.buffer)

502
503
504
505
506
507
508
    def broadcast_object(self, obj=None):
        if self._is_writer:
            self.enqueue(obj)
            return obj
        else:
            return self.dequeue()

509
    @staticmethod
510
511
    def create_from_process_group(pg: Union[ProcessGroup,
                                            StatelessProcessGroup],
512
513
                                  max_chunk_bytes,
                                  max_chunks,
514
                                  writer_rank=0) -> "MessageQueue":
515
516
517
518
519
520
521
522
        if isinstance(pg, ProcessGroup):
            group_rank = dist.get_rank(pg)
            group_world_size = dist.get_world_size(pg)
            global_ranks = dist.get_process_group_ranks(pg)
        else:
            group_rank = pg.rank
            group_world_size = pg.world_size
            global_ranks = list(range(pg.world_size))
523
524
525
526

        from vllm.distributed.parallel_state import in_the_same_node_as
        status = in_the_same_node_as(pg, source_rank=writer_rank)
        same_node_ranks = [i for i, s in enumerate(status) if s]
527
        n_reader = group_world_size - 1
528
529
530
        n_local_reader = len(same_node_ranks) - 1
        local_reader_ranks = [i for i in same_node_ranks if i != writer_rank]
        buffer_io: MessageQueue
531
        if group_rank == writer_rank:
532
533
534
535
536
537
538
539
            buffer_io = MessageQueue(
                n_reader=n_reader,
                n_local_reader=n_local_reader,
                local_reader_ranks=local_reader_ranks,
                max_chunk_bytes=max_chunk_bytes,
                max_chunks=max_chunks,
            )
            handle = buffer_io.export_handle()
540
541
542
543
544
545
            if isinstance(pg, ProcessGroup):
                dist.broadcast_object_list([handle],
                                           src=global_ranks[writer_rank],
                                           group=pg)
            else:
                pg.broadcast_obj(handle, writer_rank)
546
        else:
547
548
549
550
551
552
553
554
            if isinstance(pg, ProcessGroup):
                recv = [None]
                dist.broadcast_object_list(recv,
                                           src=global_ranks[writer_rank],
                                           group=pg)
                handle = recv[0]  # type: ignore
            else:
                handle = pg.broadcast_obj(None, writer_rank)
555
556
557
            buffer_io = MessageQueue.create_from_handle(handle, group_rank)
        buffer_io.wait_until_ready()
        return buffer_io