Abstract: Disclosed herein are a logical qubit execution apparatus and method. The logical qubit execution apparatus may be configured to execute, by a logical execution layer, a quantum circuit including requested logical qubits using a lattice surgery operation, generate, by the logical execution layer, measurement results of the logical qubits by combining measurement results of logical Pauli frames, generate, by a physical execution layer, a physical qubit circuit by converting a logical qubit operation corresponding to the measurement results of the logical qubits into a physical qubit operation, and measure, by the physical execution layer, results of an operation on physical Pauli frames by executing the physical qubit circuit.

Abstract: Disclosed is a quantum computing system including a first quantum chip including first physical qubits, a second quantum chip including second physical qubits, and a management device. The management device includes a physical qubit layer that manages physical qubit mapping including information about physical channels between first and second physical qubits, an abstraction qubit layer that manages abstraction qubit mapping including information about abstraction qubits and abstraction channels between the abstraction qubits based on the physical qubit mapping, a logical qubit layer that divides the abstraction qubits into logical qubits and to manage logical qubit mapping including information about logical channels between the logical qubits, based on the abstraction qubit mapping, and an application qubit layer that allocates at least one logical qubit corresponding to a qubit request received from a quantum application program based on the logical qubit mapping.

Abstract: A quantum computing system according to an embodiment of the present disclosure includes a logical qubit quantum compiler configured to receive a specific quantum code and to output a quantum kernel based on a quantum basic operation command, a logical qubit quantum kernel executor configured to generate a plurality of physical qubit quantum commands based on the quantum kernel, and a physical qubit quantum system configured to receive the physical qubit quantum command and to perform a physical quantum operation.

Abstract: Disclosed is an operating method of a surface code-based quantum simulation device including physical qubit storage, which includes storing initialized entanglement states of logical qubits corresponding to different distances, receiving a surface code-based initialization request corresponding to a specific distance, and storing an initialized entanglement state of a logical qubit corresponding to the specific distance from among the initialized entanglement states of the logical qubits corresponding to the different distances in the physical qubit storage.

Abstract: Disclosed is a quantum computing system including a first quantum chip including first physical qubits, a second quantum chip including second physical qubits, and a management device. The management device includes a physical qubit layer that manages physical qubit mapping including information about physical channels between first and second physical qubits, an abstraction qubit layer that manages abstraction qubit mapping including information about abstraction qubits and abstraction channels between the abstraction qubits based on the physical qubit mapping, a logical qubit layer that divides the abstraction qubits into logical qubits and to manage logical qubit mapping including information about logical channels between the logical qubits, based on the abstraction qubit mapping, and an application qubit layer that allocates at least one logical qubit corresponding to a qubit request received from a quantum application program based on the logical qubit mapping.

Abstract: A method and apparatus are disclosed which relate generally to worker-scheduling technology in a serverless cloud-computing environment, and more particularly, to technology that allocates workers for executing functions on a micro-function platform which provides a function-level micro-service. The method and apparatus process a worker allocation task in a distributed manner as two-step pre-allocation schemes before a worker allocation request occurs, and pre-allocates workers required for a service using a function request period and a function execution time, thus minimizing scheduling costs incurred by worker allocation requests.

Abstract: Disclosed herein are an apparatus and method for setting the allocation rate of a parallel-computing accelerator. The method includes monitoring the utilization rate of the parallel-computing accelerator by an application and setting a start point, at which measurement of utilization data to be used for setting the allocation rate of the parallel-computing accelerator for the application is started, using the result of monitoring the utilization rate; setting an end point, at which the measurement of the utilization data is finished, based on the monitoring result; and setting the allocation rate of the parallel-computing accelerator using the utilization data measured during a time period from the start point to the end point.

Abstract: An apparatus and method for executing a function. The apparatus includes one or more processors and executable memory for storing at least one program executed by the one or more processors, and the at least one program is configured to determine whether it is possible to reengineer a user function source using interface description language (IDL) code, to generate a reengineered function source by reengineering the user function source, and to execute the reengineered function source.

Abstract: Disclosed herein is a distributed file system using a torus network. The distributed file system includes multiple servers. The location of a master server may be determined to shorten the latency of data input/output. The location of the master server may be determined such that the distance between the master server and a node farthest away from the master server, among nodes, is minimized. When the location of the master server is determined, the characteristics of the torus network and the features of a propagation transmission scheme may be taken into consideration.

Abstract: A worker-scheduling method in a cloud-computing system and an apparatus for the same. The worker-scheduling method includes performing a first load-distribution operation of pre-creating template workers so as to process worker execution preparation loads in a distributed manner before a worker allocation request for function execution occurs, predicting a number of workers to be pre-allocated in consideration of variation in a worker allocation request period for each function, and performing a second load distribution operation of pre-allocating ready workers by performing worker upscaling on as many template workers as the number of workers to be pre-allocated.

Abstract: An apparatus and method for executing a function. The apparatus includes one or more processors and executable memory for storing at least one program executed by the one or more processors, and the at least one program is configured to determine whether it is possible to reengineer a user function source using interface description language (IDL) code, to generate a reengineered function source by reengineering the user function source, and to execute the reengineered function source.

Abstract: Disclosed herein are an apparatus and method for setting the allocation rate of a parallel-computing accelerator. The method includes monitoring the utilization rate of the parallel-computing accelerator by an application and setting a start point, at which measurement of utilization data to be used for setting the allocation rate of the parallel-computing accelerator for the application is started, using the result of monitoring the utilization rate; setting an end point, at which the measurement of the utilization data is finished, based on the monitoring result; and setting the allocation rate of the parallel-computing accelerator using the utilization data measured during a time period from the start point to the end point.

Abstract: Disclosed herein is a distributed file system using a torus network. The distributed file system includes multiple servers. The location of a master server may be determined to shorten the latency of data input/output. The location of the master server may be determined such that the distance between the master server and a node farthest away from the master server, among nodes, is minimized. When the location of the master server is determined, the characteristics of the torus network and the features of a propagation transmission scheme may be taken into consideration.

Abstract: A distributed file system, based on a torus network, includes a center node and one or more storage nodes. The center node encodes data when the data is received from a client. The one or more storage nodes receive data blocks or parity blocks from the center node and store the data blocks or parity blocks.

Abstract: Disclosed herein is a network selecting apparatus including: a determining unit checking an operation state of a cache server in which replicated data corresponding to a data request signal are stored and determining whether the cache server is normally operated, when the data request signal is received from a client; and a selecting unit selecting a first network so that the replicated data are transmitted to input and output devices when the cache server is normally operated and selecting a second network so that original data corresponding to the data request signal are transmitted from a storage server in which the original data are stored to the input and output devices when the cache server is not normally operated.

Abstract: Provided herein a method for allocating storage space using a buddy allocator, the method including receiving, by a buddy allocator, a block allocation request from a space allocation requestor, selecting, by the buddy allocator, a first buddy in response to the block allocation request, wherein the first buddy is one of a plurality of buddies, checking, by the buddy allocator, whether blocks of the first buddy include a first spare storage space to which storage space corresponding to the block allocation request is allocated, allocating, by the buddy allocator, the storage space to the blocks of the first buddy when it is checked that the blocks of the first buddy include the first spare storage space, and deallocating, by the buddy allocator, excess storage space of allocated storage space when a size of the allocated storage space is greater than the storage corresponding to the block allocation request, wherein the excess storage space is not corresponding to the block allocation request.

Abstract: A distributed file system based on a torus network includes a center node configured to encode data when the data is received from a client and one or more storage nodes configured to receive data blocks or parity blocks generated by the encoding from the center node and store the data blocks or parity blocks.

Abstract: There are provided a system and method for providing a virtual desktop service using a cache server. A system for providing a virtual desktop service according to the invention includes a host server configured to provide a virtual desktop service to a client terminal using a virtual machine, a distributed file system configured to store data for the virtual machine, and a cache server that is provided for each host server group having at least one host server, and performs a read process or a write process of data using physically separate caches when the read process or write process of the data is requested from the virtual machine in the host server.

Abstract: Provided herein a method for allocating storage space using a buddy allocator, the method including receiving, by a buddy allocator, a block allocation request from a space allocation requestor, selecting, by the buddy allocator, a first buddy in response to the block allocation request, wherein the first buddy is one of a plurality of buddies, checking, by the buddy allocator, whether blocks of the first buddy include a first spare storage space to which storage space corresponding to the block allocation request is allocated, allocating, by the buddy allocator, the storage space to the blocks of the first buddy when it is checked that the blocks of the first buddy include the first spare storage space, and deallocating, by the buddy allocator, excess storage space of allocated storage space when a size of the allocated storage space is greater than the storage corresponding to the block allocation request, wherein the excess storage space is not corresponding to the block allocation request.

Abstract: Disclosed herein is a method and apparatus for supporting virtualization. In the method, conversion of source code of a loadable module is initiated. A virtualization-sensitive instruction is searched for during the conversion of the source code. If the virtualization-sensitive instruction has been found, a virtualization-sensitive instruction table is generated based on the found virtualization-sensitive instruction. The virtualization-sensitive instruction is substituted with an instruction recognizable in a privileged mode, based on the generated virtualization-sensitive instruction table. The loadable module is loaded and executed in a kernel. Accordingly, the present invention supports virtualization, thus minimizing overhead occurring in full virtualization, and guaranteeing the high performance provided by para-virtualization without modifying a source.