Typically, the sharing of memory buffers between computing devices would require the devices to exchange a pointer or handle in the device address space or in the physical address space. In most cases, before using this pointer, the compute device converts the pointer to the local virtual address space with the memory management unit (MMU) page table mapping. This renders the sharing of the pointer itself or of structures containing pointers inefficient and challenging.
The advantages of the methods and mechanisms described herein may be better understood by referring to the following description in conjunction with the accompanying drawings, in which:
In the following description, numerous specific details are set forth to provide a thorough understanding of the methods and mechanisms presented herein. However, one having ordinary skill in the art should recognize that the various implementations may be practiced without these specific details. In some instances, well-known structures, components, signals, computer program instructions, and techniques have not been shown in detail to avoid obscuring the approaches described herein. It will be appreciated that for simplicity and clarity of illustration, elements shown in the figures have not necessarily been drawn to scale. For example, the dimensions of some of the elements may be exaggerated relative to other elements.
Systems, apparatuses, and methods for implementing a unified kernel virtual address space for heterogeneous computing are disclosed herein. In one implementation, a system includes at least a first subsystem running a first kernel, an input/output memory management unit (IOMMU), and a second subsystem running a second kernel. In one implementation, the IOMMU creates a unified kernel address space allowing the first and second subsystems to share memory buffers at the kernel level. In order to share a memory buffer between the two subsystems, the first subsystem allocates a block of memory in part of the system memory controlled by the first subsystem. A first mapping is created from a first logical address of the first kernel address space of the first subsystem to the block of memory. Then, the IOMMU creates a second mapping to map the physical address of that block of memory from a second logical address of the second kernel address space of the second subsystem. These mappings allow the first and second subsystems to share buffer pointers in the kernel address space which reference the block of memory.
Referring now to
In one implementation, first and second subsystems 110 and 115 have different kernel address spaces, but a unified kernel address space is created by IOMMU 125 for the first and second subsystems 110 and 115. The unified kernel address space allows the first and second subsystems 110 and 115 to pass pointers between each other and share buffers. For first subsystem 110 and second subsystem 115, their respective kernel address space includes kernel logical addresses and kernel virtual addresses. On some architectures, a kernel logical address and its associated physical address differ by a constant offset. Kernel virtual addresses do not necessarily have a linear, one-to-one mapping to physical addresses that characterize kernel logical addresses. All kernel logical addresses are kernel virtual addresses, but kernel virtual addresses are not necessarily kernel logical addresses.
In one implementation, each of first subsystem 110 and second subsystem 115 includes one or more processors which execute an operating system. The processor(s) also execute one or more software programs in various implementations. The processor(s) of first subsystem 110 and second subsystem 115 include any number and type of processing units (e.g., central processing unit (CPU), graphics processing unit (GPU), digital signal processor (DSP), field programmable gate array (FPGA), application specific integrated circuit (ASIC)). Also, first subsystem 110 includes memory management unit (MMU) 112 and second subsystem 115 includes MMU 117, with each MMU handling virtual to physical address translations for its corresponding subsystem. While first and second subsystems 110 and 115 have different kernel address spaces, a unified kernel address space is created by IOMMU 125 for the first and second subsystems 110 and 115, allowing the first and second subsystems 110 and 115 to pass pointers back and forth and share buffers in memory subsystem 130.
Memory subsystem 130 includes any number and type of memory devices. For example, the type of memory in memory subsystem 130 can include high-bandwidth memory (HBM), non-volatile memory (NVM), Dynamic Random Access Memory (DRAM), Static Random Access Memory (SRAM), NAND Flash memory, NOR flash memory, Ferroelectric Random Access Memory (FeRAM), or others. I/O interfaces 120 are representative of any number and type of I/O interfaces (e.g., peripheral component interconnect (PCI) bus, PCI-Extended (PCI-X), PCIE (PCI Express) bus, gigabit Ethernet (GBE) bus, universal serial bus (USB)). Various types of peripheral devices 135 can be coupled to I/O interfaces 120. Such peripheral devices 135 include (but are not limited to) displays, keyboards, mice, printers, scanners, joysticks or other types of game controllers, media recording devices, external storage devices, network interface cards, and so forth.
In one implementation, in order to create a memory space that is shared between first subsystem 110 and second subsystem 115, a block of memory is allocated in a part of system memory managed by first subsystem 110. After the initial block of memory is allocated, the proper I/O virtual address (VA) is assigned to the second subsystem 115. In one implementation, an IOMMU mapping is created from the kernel address space of second subsystem 115 to the physical address of the block of memory. In this implementation, IOMMU 125 performs the virtual address mapping for the second subsystem 115 to the block of memory. Then, when additional memory is allocated, the heap allocate function is called, and the address is mapped based on the same I/O VA address that was earlier created. Then, a message is sent to the second subsystem 115 notifying the second subsystem 115 of the unified address.
In various implementations, computing system 100 is a computer, laptop, mobile device, game console, server, streaming device, wearable device, or any of various other types of computing systems or devices. It is noted that the number of components of computing system 100 varies from implementation to implementation. In other implementations, there are more or fewer of each component than the number shown in
Turning now to
In one implementation, a first step 205 is performed by device driver 206 to create a heap (i.e., a shared memory region). As used herein, the term “heap” is defined as a virtual memory pool that is mapped to a physical memory pool. Next, in step 210, a desired size of the heap is allocated in the physical memory subsystem. In step 215, a mapping from the kernel to the heap is created. In one implementation, when the carveout heap is first created, a new flag indicates if the heap should come from the kernel logical address space. For example, the kmalloc function returns memory in the kernel logical address space. In one implementation, for a Linux® operating system, the memory manager manages the buffer allocated for the heap using the Linux genpool library. In this implementation, when a buffer is allocated, the buffer is marked in the internal pool and the physical address is returned. The carveout heap then wraps this physical address with the buffer and sg_table descriptors. In one implementation, when the buffer is mapped in the kernel address space, the heap_map_kernel function maps the buffer using kmap instead of vmap in step 220. The function kmap maps the buffer to a given virtual address based on a logical mapping. The selection of kmap or vmap is controlled by a new flag given during carveout heap creation. Alternatively, the heap is created together with the kernel mapping using the genpool library, the carveout application programming interface (API), and the new flag. In this case, the kernel map returns the pre-mapped address. User mode mapping will still be applied on the fly. For second subsystem 214, any shared memory buffer allocated by first subsystem 202 is managed similar to the carveout heap wrapped genpool. The new API allows the addition of an external buffer to the carveout heap. Local tasks on second subsystem 214 allocate from this carveout heap using the same API. After step 220, the allocation of the shared memory region is complete.
Next, in step 225, an input/output (I/O) virtual address is allocated by IOMMU 211 for the shared memory region. Then, in step 230, a contiguous block of DMA address space is reserved for the shared memory region. Next, in step 235, the shared memory region is mapped by IOMMU 211 to the kernel address space of second subsystem 214. It is noted that the IOMMU mapping should not be freed until the device driver 206 has been shutdown. The mapping from the kernel address space of first subsystem 202 to the shared memory region is invalidated in step 240. Then, in step 245, the kernel address space mapping is freed by executing a memory release function.
Referring now to
For loop exchange 305, a block of memory is allocated and a mapping from the kernel address space of first subsystem 302 to the physical address of the memory block is created by device driver 306. The mapping is then maintained by MMU 304. The memory block can be assigned to second subsystem 314 exclusively, shared between first subsystem 302 and second subsystem 314, or assigned to first subsystem 302 exclusively. Then, a message is sent from first subsystem 302 to second subsystem 314 with the address and size of the block of memory. In one implementation, the message can be sent out-of-band. After the message is received by second subsystem 314, a mapping from the kernel address space of second subsystem 314 to the physical address of the memory block is created and maintained by MMU 312. For loop exchange 315, data is exchanged between first subsystem 302 and second subsystem 314 using the shared region 308. With the unified kernel virtual address, the buffer pointers 1st_SS_buf and 2nd_SS_buf are the same and can be freely exchanged between first subsystem 302 and second subsystem 314 and further partitioned using the genpool library.
Turning now to
In one implementation, first subsystem virtual address space 402 includes shared region 420 which is mapped to memory block 425 and memory block 430 of physical memory space 404. In one implementation, the mappings of shared region 420 to memory block 425 and memory block 430 are created and maintained by first subsystem MMU 412. In order to allow shared region 420 to be shared with the second subsystem, memory block 425 and memory block 430 are mapped to shared region 435 of device memory space 406 by IOMMU 414. Then, shared region 435 is mapped to shared region 440 of second subsystem virtual address space 408 by second subsystem MMU 416. Through this mapping scheme, the first subsystem and the second subsystem are able to share buffer pointers with each other in their kernel address space.
Referring now to
A first subsystem allocates a block of memory at a first physical address in a physical address space corresponding to a memory subsystem (block 505). In one implementation, the first subsystem executes a first operating system with a first kernel address space. Next, the first subsystem creates a mapping of a first logical address in the first kernel address space to the first physical address (block 510). It is noted that the first logical address space of the first kernel address space is a first linear offset from the first physical address. Then, an IOMMU creates an IOMMU mapping of a second logical address in a second kernel address space to the first physical address (block 515). In one implementation, the second kernel address space is associated with a second subsystem. It is noted that the second logical address space of the second kernel address space is a second linear offset from the first physical address.
Next, the first subsystem conveys a buffer pointer to the second subsystem, where the buffer pointer points to the first logical address (block 520). Then, the second subsystem generates an access request with the buffer pointer and conveys the access request to the IOMMU (block 525). Next, the IOMMU translates a virtual address of the buffer pointer to the first physical address using the previously created IOMMU mapping (block 530). Then, the second subsystem accesses the block of memory at the first physical address (block 535). After block 535, method 500 ends.
Turning now to
Next, an IOMMU selects a device address that is a second offset away from the first logical address in the second kernel address space (block 615). Then, the IOMMU creates an IOMMU mapping of the selected device address in the device address space to the first physical address (block 620). The IOMMU mapping enables a common shared region in both the first kernel address space and the second kernel address space for use by both the first subsystem and the second subsystem (block 625). After block 625, method 600 ends.
Referring now to
In various implementations, program instructions of a software application are used to implement the methods and/or mechanisms described herein. For example, program instructions executable by a general or special purpose processor are contemplated. In various implementations, such program instructions can be represented by a high level programming language. In other implementations, the program instructions can be compiled from a high level programming language to a binary, intermediate, or other form. Alternatively, program instructions can be written that describe the behavior or design of hardware. Such program instructions can be represented by a high-level programming language, such as C. Alternatively, a hardware design language (HDL) such as Verilog can be used. In various implementations, the program instructions are stored on any of a variety of non-transitory computer readable storage mediums. The storage medium is accessible by a computing system during use to provide the program instructions to the computing system for program execution. Generally speaking, such a computing system includes at least one or more memories and one or more processors configured to execute program instructions.
It should be emphasized that the above-described implementations are only non-limiting examples of implementations. Numerous variations and modifications will become apparent to those skilled in the art once the above disclosure is fully appreciated. It is intended that the following claims be interpreted to embrace all such variations and modifications.
This application is a continuation of U.S. patent application Ser. No. 16/519,311, entitled “UNIFIED KERNEL VIRTUAL ADDRESS SPACE FOR HETEROGENEOUS COMPUTING”, filed Jul. 23, 2019, the entirety of which is incorporated herein by reference.
Number | Name | Date | Kind |
---|---|---|---|
6961941 | Nelson | Nov 2005 | B1 |
7500048 | Venkitachalam | Mar 2009 | B1 |
7543131 | Hummel et al. | Jun 2009 | B2 |
7548999 | Haertel et al. | Jun 2009 | B2 |
7634584 | Pope et al. | Dec 2009 | B2 |
8386745 | Kegel et al. | Feb 2013 | B2 |
9535849 | Kegel et al. | Jan 2017 | B2 |
9628279 | Probert | Apr 2017 | B2 |
10198202 | Tsirkin | Feb 2019 | B2 |
10459850 | Kaplan | Oct 2019 | B2 |
10678432 | Dreier et al. | Jun 2020 | B1 |
10853263 | Kwong et al. | Dec 2020 | B1 |
20040064813 | Neiger | Apr 2004 | A1 |
20040186946 | Lee | Sep 2004 | A1 |
20050256976 | Susairaj et al. | Nov 2005 | A1 |
20060075146 | Schoinas et al. | Apr 2006 | A1 |
20060277348 | Wooten | Dec 2006 | A1 |
20070168643 | Hummel et al. | Jul 2007 | A1 |
20080114906 | Hummel et al. | May 2008 | A1 |
20080114916 | Hummel et al. | May 2008 | A1 |
20080120487 | Saripalli | May 2008 | A1 |
20080148300 | Archer | Jun 2008 | A1 |
20080209130 | Kegel et al. | Aug 2008 | A1 |
20090037936 | Serebrin | Feb 2009 | A1 |
20090043985 | Tuuk et al. | Feb 2009 | A1 |
20090187697 | Serebrin | Jul 2009 | A1 |
20090187729 | Serebrin et al. | Jul 2009 | A1 |
20100191889 | Serebrin | Jul 2010 | A1 |
20120017029 | Santos et al. | Jan 2012 | A1 |
20120265963 | Agesen | Oct 2012 | A1 |
20130159564 | Duncan et al. | Jun 2013 | A1 |
20130262736 | Kegel et al. | Oct 2013 | A1 |
20140049548 | Rao | Feb 2014 | A1 |
20170123971 | Kanaujia et al. | May 2017 | A1 |
20180136687 | Tsirkin et al. | May 2018 | A1 |
20190114193 | Cha | Apr 2019 | A1 |
20190236020 | Jang | Aug 2019 | A1 |
20190306087 | Masputra et al. | Oct 2019 | A1 |
20190370050 | Kumar et al. | Dec 2019 | A1 |
20200081638 | Zhou | Mar 2020 | A1 |
Entry |
---|
International Search Report and Written Opinion in International Application No. PCT/US2010/0043168, dated Nov. 5, 2010, 9 pages. |
Office Action from Japanese Patent Application No. 2012521868, dated Jul. 30, 2014, English and Japanese versions, pp. 1-4. |
International Search Report and Written Opinion in International Application No. PCT/IB2020/056906, dated Oct. 15, 2020, 9 pages. |
Extended European Search Report for European Application No. 20844551.0 dated Jul. 12, 2023. |
Number | Date | Country | |
---|---|---|---|
20210081328 A1 | Mar 2021 | US |
Number | Date | Country | |
---|---|---|---|
Parent | 16519311 | Jul 2019 | US |
Child | 17105331 | US |