公开(公告)号：US10042659B1

公开(公告)日：2018-08-07

申请号：US14067721

申请日：2013-10-30

Applicant: Xilinx, Inc.

Inventor： Ashish Gupta ,  Hanh Hoang ,  Siva Prasad Gadey ,  Kiran S. Puranik

IPC: G06F9/455

Abstract: A method for providing access by a virtual context to a physical instance includes receiving a request to access a physical instance of a plurality of physical instances of a hardware resource of a device. The request is associated with a virtual machine of a plurality of virtual machines. The method next determines that one of the physical instances is available, and assigns a virtual context associated with the virtual machine to access the one of the physical instances when the one of the physical instances is available. The assigning comprises retrieving the virtual context from a memory of the device and loading the virtual context into the one of the physical instances. The method then stores the virtual context in the memory after the one of the physical instances is accessed by the virtual context.

公开(公告)号：US10031760B1

公开(公告)日：2018-07-24

申请号：US15160993

申请日：2016-05-20

Applicant: Xilinx, Inc.

Inventor： Sonal Santan ,  Raymond Kong ,  Yenpang Lin ,  Jun Liu ,  Ashish Gupta ,  Spenser Gilliland ,  Brian S. Martin

IPC: G06F15/177 ,  G06F9/4401

Abstract: Managing an accelerator may include responsive to determining a first container including a first configuration file and a second configuration file, caching, using a host processor, the second configuration file within a local memory of the host processor. The first configuration file may be provided, using the host processor, to a device of the accelerator. Responsive to a configuration event, the host processor may provide the cached second configuration file from the local memory to the device of the accelerator.

公开(公告)号：US09100015B1

公开(公告)日：2015-08-04

申请号：US14322384

申请日：2014-07-02

Applicant: Xilinx, Inc.

Inventor： Chuan Cheng Pan ,  Ashish Gupta ,  Siva Prasad Gadey

IPC: H03K19/20 ,  H03K19/21

CPC classification number: H03K19/20 ,  H03K19/21 ,  H03K19/212

Abstract: Finding the first bit that is set in an n-bit input word includes generating n n-bit patterns from an n-bit input word. If the bit at one bit position of the input word has a logic 1 value, a corresponding pattern has a logic 1 value in a corresponding bit position and in each bit position left of the corresponding bit position, and a logic 0 value in each bit position right of the corresponding bit position. If the bit at the one bit position of the input word has a logic 0 value, the corresponding pattern has a logic 0 value in every bit position. The n patterns are combined into one merged n-bit pattern. An output n-bit pattern is generated from the merged n-bit pattern. The output pattern has a logic 1 value in one bit position that is the same as the rightmost bit position of the input word having a logic 1 value, and a logic 0 value in every other bit position.

Abstract translation: 查找在n位输入字中设置的第一位包括从n位输入字生成n个n位模式。 如果输入字的一位位置的位具有逻辑1值，则对应的模式在对应位位置和相应位位置左侧的每个位位置中具有逻辑1值，并且每个位中的逻辑0值 相应位位置的右侧。 如果输入字的一位位置的位具有逻辑0值，则相应的模式在每个位的位置都有一个逻辑0值。 n个图案被组合成一个合并的n位模式。 从合并的n位模式生成输出n位模式。 输出图案在一个位位置具有与具有逻辑1值的输入字的最右边位置相同的一个位置中的逻辑1值，以及每隔一个位位置的逻辑0值。