Qubit reservation is disclosed. A first request to reserve at least one qubit is received from a requestor. The first request includes an application identifier (ID) of a first quantum application. Qubit metadata that describes characteristics of a first plurality of qubits implemented by a first quantum computing system is accessed to identify a first qubit that is available to be reserved. The qubit metadata is modified to reserve the first qubit to thereby inhibit access to the first qubit by any quantum application other than the first quantum application.

Systems and methods are provided for reserving resources in a telecommunication network. The method including: receiving, at a node, a first service request to reserve a quantity of resources from a subscriber's first account, wherein the quantity of resources requested to be reserved are greater than an amount of available resources in the subscriber's first account; determining, at the node, that the quantity of resources needed to be reserved is within an overbooking limit associated with the subscriber's first account; and reserving, based on the determining step, the requested quantity of resources.

An apparatus is provided comprising interface circuitry, machine-readable instructions, and processing circuitry to execute the machine-readable instructions to receive a request to execute a task on a computing system, receive a requirement of the task for usage of a resource of the computing system, and schedule execution of the task by reserving at least part of the resource for the execution of the task based on the requirement.

Described is a technology by which an owner node in a server cluster maintains ownership of a storage mechanism through a persistent reservation mechanism, while allowing non-owning nodes read and write access to the storage mechanism. An owner node writes a reservation key to a registration table associated with the storage mechanism. Non-owning nodes write a shared key that gives them read and write access. The owner node validates the shared keys against cluster membership data, and preempts (e.g., removes) any key deemed not valid. The owner node also defends ownership against challenges to ownership made by other nodes, so that another node can take over ownership if a (formerly) owning node is unable to defend, e.g., because of a failure.

A virtual resource management device (1) includes a scaling request reception unit (11) that receives a scale-in request; a virtual resource identification unit (12) that identifies a virtual resource to be deleted by using a predetermined virtual resource identification logic according to a deletion strategy indicated by the scale-in request; and a scaling processing unit (13) that transmits a scale-in preparation request including information on the identified virtual resource to the VNF to stop communication to the virtual resource, and in response to receiving a scale-in preparation completion response indicating the communication has been stopped from the VNF, deletes the virtual resource to be deleted.

The present memory restoration system enables a collection of computing systems to prepare inactive rewritable memory for reserve and future replacement of other memory while the other memory is active and available for access by a user of the computing system. The preparation of the reserved memory part is performed off-line in a manner that is isolated from the current user of the active memory part. Preparation of memory includes erasure of data, reconfiguration, etc. The memory restoration system allows for simple exchange of the reserved memory part, once the active memory part is returned. The previously active memory may be concurrently recycled for future reuse in this same manner to become a reserved memory. This enables the computing collection infrastructure to “swap” to what was previously the inactive memory part when a user vacates a server, speeding up the server wipe process.

A method includes receiving a reservation request corresponding to resource requirements of an application. The reservation request including an amount of resources requested for the application. Determining an initial intra-tenant threshold based on the reservation request. Reserving an amount of intra-tenant resources. The amount of intra-tenant resources reserved being greater than the amount of resources requested. Monitoring tenant resource usage assigned to execute the application. The method further includes storing resource usage data periodically. The method further includes predicting future tenant resource usage based on the resource usage data. The method further includes responsive to the predicted future tenant resource usage, performing at least one of: determining a new intra-tenant threshold to be recommended in response to the initial intra-tenant threshold being set too high or too low, or generating an alert indicating that the initial intra-tenant threshold is insufficient to support the predicted future tenant resource usage.

In a content supply system, in order to use a streaming server to perform a live distribution, a user PC used makes a reservation for a time zone, etc. to a server reservation control center. When the user PC sends desired reservation information to the server reservation control center via the Internet, if the reservation is accepted, a reservation ID only used for authentication of the reservation is created and sent from the server reservation control center to the user PC via the Internet. When a distribution request is sent from the user PC to the streaming server, authentication processing using this reservation ID is performed.

The invention provides a system and method for managing clusters of parallel processors for use by groups and individuals requiring supercomputer level computational power. A Beowulf cluster provides supercomputer level processing power. Unlike a traditional Beowulf cluster; however, cluster size in not singular or static. As jobs are received from users/customers, a Resource Management System (RMS) dynamically configures and reconfigures the available nodes in the system into clusters of the appropriate sizes to process the jobs. Depending on the overall size of the system, many users may have simultaneous access to supercomputer level computational processing. Users are preferably billed based on the time for completion with faster times demanding higher fees.

Methods, systems, and computer readable and executable medium embodiments for managing virtual machine pool demand are described herein. One method for managing virtual machine pool demand includes determining a demand for a number of virtual machines in a pool using data received, identifying the demand for the number of virtual machines in the pool is outside a threshold number, and sending a request for an additional virtual machine to a user to manage demand of the pool.