Abstract: In some implementations, a device may determine whether an existing record for a file, received at a file storage location, is present in a record log. The device may generate, based on determining that the existing record for the file is not present in the record log, a record for the file in the record log. The record may identify the file and a first region. The device may determine, after generating the record, whether the record has been changed to identify a second region. The device may process the file based on determining that the record has not been changed to identify the second region.

Abstract: An apparatus includes logic circuitry that selects a retag transaction identifier for an original transaction identifier of an incoming transaction request, based on a plurality of sub-groups of retag tracking data. Each sub-group of retag tracking data is associated with a corresponding sub-group of retag transaction identifiers in a group of retag transaction identifiers. The logic circuitry retags the incoming transaction request with the selected retag transaction identifier (ID) by replacing the original transaction identifier associated with the incoming transaction request and sends the retagged incoming transaction request to a target. A returned response is received from the target. The retag transaction ID in the returned response is removed and replaced with the original transaction ID before being sent as a reply to the requesting unit. Associated methods are also presented.

Abstract: Systems and methods for opening files on a client device include receiving a request to open a file and identifying a file type pertaining to the file. A list of software applications is identified that are capable of opening the identified file type, and metadata pertaining to each of the software applications on the list is retrieved. User preference data pertaining to a user requesting to open the file is also retrieved. Scores for the software applications on the list are then determined based at least on the metadata and the user preference data. At least one software application on the list is then selected to open the file on the client device based on the determined scores.

Abstract: A method for processing a series of database transactions according to an embodiment includes recording a first transaction requested to a first database by a first application, among the plurality of applications, in association with a transaction group ID, recording a second transaction requested to a second database by a second application called by the first application, among the plurality of applications, in association with the transaction group ID, rolling back the second transaction targeted to the second database in response to a determination that an error has occurred during processing of the second transaction, identifying the first transaction based on the transaction group ID and rolling back the first transaction targeted to the first database.

Abstract: Mechanisms are disclosed for performing efficient lossless encryption and decryption to reduce power consumption and improve the efficiency of processing streams of digital data. An input data stream associated with a stream of input data is received. A discrete wavelet transform is applied to a first serial input data value in the input data stream. Distributed components of the first serial input data value are distributed by computing a cumulative probability that the first serial input data value is less than or equal to a power-of-two range value associated with a power-of-two probability distribution function. An entropy encoded encryption value is computed based on a range variant asymmetrical numeral system based on the power-of-two probability distribution function. The entropy encoded encryption value is unloaded based on one or more computed next states. Compressed serial output data streams are compressed based on the unloaded entropy encoded encryption value.

Abstract: An HTM-assisted Combining Framework (HCF) may enable multiple (combiner and non-combiner) threads to access a shared data structure concurrently using hardware transactional memory (HTM). As long as a combiner executes in a hardware transaction and ensures that the lock associated with the data structure is available, it may execute concurrently with other threads operating on the data structure. HCF may include attempting to apply operations to a concurrent data structure utilizing HTM and if the HTM attempt fails, utilizing flat combining within HTM transactions. Publication lists may be used to announce operations to be applied to a concurrent data structure. A combiner thread may select a subset of the operations in the publication list and attempt to apply the selected operations using HTM. If the thread fails in these HTM attempts, it may acquire a lock associated with the data structure and apply the selected operations without HTM.

Abstract: The described technology relates to a real-time processing of network packets. An example system relates to reordering messages received at a server over a communication network from distributed clients, in order to, among other things, eliminate or at least substantially reduce the effects of jitter (delay variance) experienced in the network. The reordering of messages may enable the example data processing application to improve the consistency of processing packets in the time order of when the respective packets entered a geographically distributed network.

Abstract: One embodiment provides for a method of transmitting data between multiple compute nodes of a distributed compute system, the method comprising multi-dimensionally partitioning data of a feature map across multiple nodes for distributed training of a convolutional neural network; performing a parallel convolution operation on the multiple partitions to train weight data of the neural network; and exchanging data between nodes to enable computation of halo regions, the halo regions having dependencies on data processed by a different node.

Abstract: The present disclosure relates to a method, a device, and a program product for managing multiple computing tasks on a batch basis. A method includes: identifying a task type of the multiple computing tasks in response to receiving a request to use a computing unit in a computing system to perform the multiple computing tasks; acquiring a scheduling time overhead incurred for scheduling the multiple computing tasks for execution by the computing unit; determining, based on the task type and the scheduling time overhead, a batch size for dividing the multiple computing tasks; and dividing the multiple computing tasks into at least one batch based on the batch size. A corresponding device and a corresponding computer program product are provided. With the example implementations of the present disclosure, the batch size for dividing multiple computing tasks can be dynamically determined, so that the performance of the computing system can meet user demands.

Abstract: Orchestrating data pipelines in a pre-orchestrated manner. In some instances, workflows and microservices are performed in stages. The order in which these stages are performed are pre-dominantly non-sequential in order to ensure that the most relevant stages are performed in a manner that allows the workflows to be processed and microservices to be utilized in the most efficient manner possible. In some instances, when the processes in the first stage is complete, a broadcast message is published to a topic that indicates that the first stage is completed and the second stage can commence. In order to determine which processes can be performed in the second stage, a configuration table is utilized. This general process is repeated until each stage in the data pipeline is complete.

Abstract: Described herein is a graphics processor configured to perform asynchronous input dependency resolution among a group of interdependent workloads. The graphics processor can dynamically resolve input dependencies among the workloads according to a dependency relationship defined for the workloads. Dependency resolution be performed via a deferred submission mode which resolves input dependencies prior to thread dispatch to the processing resources or via immediate submission mode which resolves input dependencies at the processing resources.

Abstract: This disclosure relates generally to method of modernizing a legacy batch based on at least one functional context. The method includes at least one of: preprocessing, a plurality of metadata associated with a plurality of batches to obtain a plurality of derived data; generating, the functional context based on the plurality of derived data; determining, an average elapsed time for at least one application from the at least one functional context; parsing, log of the at least one consistent long running job to identify step and associated file referenced in the at least one long running job; determining, a hotspot based on at least program; and recommending, at least one batch design associated with at least one batch job in a future state. The hotspot corresponds to long running job on a batch stream, high volume files, and program with an increased millions of instructions per second (MIPS) usage.

Abstract: Methods, systems, and computer programs are presented for processing Ethernet packets at a Field Programmable Gate Array (FPGA). One programmable integrated circuit includes: an internal network on chip (iNOC) comprising rows and columns; clusters, coupled to the iNOC, comprising a network access point (NAP) and programmable logic; and an Ethernet controller coupled to the iNOC. When the controller operates in packet mode, each complete inbound Ethernet packet is sent from the controller to one of the NAPs via the iNOC, where two or more NAPs are configurable to receive the complete inbound Ethernet packets from the controller. The controller is configurable to operate in quad segment interface (QSI) mode where each complete inbound Ethernet packet is broken into segments, which are sent from the controller to different NAPs via the iNOC, where two or more NAPs are configurable to receive the complete inbound Ethernet packets from the controller.

Abstract: Disclosed herein are system, method, and computer program product embodiments for accessing a semantic change data capture (CDC). An embodiment operates by receiving a request for changes made to a source system from a consumer at a target system. The embodiment determines a high watermark stored in a consumer registration table based on the consumer. The embodiment further determines a set of open transactions on an enhanced data table. The embodiment then determines a set of changes made to the source system based on the high watermark and the set of open transactions. The embodiment transmits the set of changes to the consumer at the target system. The embodiment then receives a confirmation from the consumer at the target system that the set of changes were committed to the target system. The embodiment then updates the high watermark in the consumer registration table based on the confirmation.

Abstract: Computer processing and outcome prediction systems and methods used to generate algorithm time prediction polynomials, inverse algorithm time prediction polynomials, determine race conditions, determine when a non-linear algorithm can be treated as if it were linear, as well as automatically generate parallel and quantum solutions from classical software or from the relationship between monotonic attribute values.

Abstract: A System on Chip (SoC) includes a processor, a parity generation circuit, and a dispatcher circuit. The processor is configured to produce store instructions for storing data blocks in a Non-Volatile-Memory (NVM). The parity generation circuit is configured to calculate parity blocks over the data blocks in accordance with a redundant storage scheme, to send the parity blocks to the NVM, and to produce completion notifications with respect to the parity blocks. The dispatcher circuit is configured to dispatch the store instructions to the NVM. The processor is further configured to send one or more parity-barrier instructions that specify synchronization barriers over the store instructions and the parity, and the dispatcher circuit is configured to dispatch the store instructions to the NVM in compliance with the parity-barrier instructions and the completion notifications.

Abstract: The system and techniques described herein include receiving a transaction report from a log dataset, where the transaction report includes a class identifier (ID) for each of the transactions, a transaction execution count, and a total transaction response time. A first listing of the transactions is generated. An average number of unique transactions assigned to all of the classes and an average transaction execution count are calculated. A second listing of the transactions is generated that includes all of the transactions for the class IDs where the count of unique transactions assigned to the class is greater than the average number of unique transactions assigned to all of the classes. For each class ID and transaction name, the second listing is updated to identify one or more of the transactions as candidate transactions for running in a P-WFI region when the conditions are met.

Abstract: Embodiments of this application provide a data processing method, apparatus, and computer-readable storage medium. The method includes acquiring a data processing request of a target service, the request including data to be processed; invoking a first worker node of the first server to execute an operation corresponding to a first service process of the target service on the data to be processed to obtain an intermediate processing result, the first worker node being a worker node on the first server for processing the first service process; and transmitting the intermediate processing result to a second server according to a next service process in a plurality of service processes in the target service, so that the second server invokes a second worker node to execute an operation on the intermediate processing result, the second worker node being a worker node on the second server for processing the next service process.

Abstract: A set of transaction handling computing elements comprise a network core that receive and process transaction requests into an append-only immutable chain of data blocks, wherein a data block is a collection of transactions, and wherein an Unspent Transaction Output (UTXO) data structure supporting the immutable chain of data blocks is an output from a finalized transaction. Typically, the UTXO data structure consists essentially of an address and a value. In this approach, at least one UTXO data structure is configured to include information either in addition to or in lieu of the address and value, thereby defining a Transaction Output (TXO). A TXO may have a variety of types, and one type includes an attribute that encodes data. In response to receipt of a request to process a transaction, the set of transaction handling computing elements are executed to process the transaction into a block using at least the information in the TXO.

Abstract: Apparatuses, systems, and techniques to parallelize operations in one or more programs with data copies from global memory to shared memory in each of the one or more programs. In at least one embodiment, a program performs operations on shared data and then asynchronously copies shared data to shared memory, and continues performing additional operations in parallel while the shared data is copied to shared memory until an indicator provided by an application programming interface to facilitate parallel computing, such as CUDA, informs said program that shared data has been copied to shared memory.

Abstract: In accordance with embodiments disclosed herein, there are provided methods, systems, mechanisms, techniques, and apparatuses for presentation of direct accessed storage under a logical drive model; for implementing a distributed architecture for cooperative NVM Data protection; data mirroring for consistent SSD latency; for boosting a controller's performance and RAS with DIF support via concurrent RAID processing; for implementing arbitration and resource schemes of a doorbell mechanism, including doorbell arbitration for fairness and prevention of attack congestion; and for implementing multiple interrupt generation using a messaging unit and NTB in a controller through use of an interrupt coalescing scheme.

Abstract: An information processing system includes one or more image capturing devices and circuitry. The one or more image capturing devices capture a first slip and a second slip to generate one or more images. The first slip has a first image code corresponding to a first type of identification information thereon, and the second slip has a second image code corresponding to a second type of identification information thereon. The circuitry is to manage a position of the first slip based on the first image code recognized from the one or more images, manage a position of the second slip based on the second image code recognized from the one or more images, and display the position of the second slip in response to an operation performed by a user.

Abstract: A method and system for reducing triggering of throughput penalties imposed on a group of users by a software-as-a-service (SaaS) server due to Application Programming Interface (API) calls exceeding limits of the SaaS server. The approaches include intercepting requests to the SaaS server from a user group and monitoring both a rate of API calls for the requests and a rate of API events generated by forwarding the API calls to the SaaS server, intercepting the SaaS server's responses, where some of the responses indicate a throughput penalty imposed by the server, identifying one or more power users from the user group based on the rate of generated notifications, and throttling the rate of the API calls for the requests submitted by the identified power users of the user group to the SaaS server in accordance with an API call throttle limit, thus reducing triggering of the throughput penalty.

Abstract: A system for quality of service management, including computing resources to provide services implemented at a provider network and network interfaces to establish a plurality of connections to perform tasks on behalf of clients. The system includes a quality of service (QOS) manager to determine respective client drop-off criteria indicating conditions for respective clients to cease communications via respective connections of the connections. The QoS manager also determines task information for respective tasks indicating a size of the respective tasks, a resource requirement for the respective tasks, or priority information for the respective tasks. The QoS manager further adjusts allocations of respective computing resources to the respective connections based on the respective client drop-off criteria and the task information. The QoS manager causes the respective computing resources to implement respective tasks on behalf of the clients according to the adjusted allocations.

Abstract: Systems, methods, and machine-readable media for organizing resources within a context, controlling access to resources, providing auditing capabilities based on the context, and granting permission to perform work using a single record object. A resource provider service may receive a request from a client. A record may be created in response to receiving the client request. The record may be associated with the requested work. The record may provide context for and permission to perform the requested work. The resource provider service may respond to the client acknowledging receiving the request. The resource provider service may record work to be done in response to receiving the request. The resource provider service may perform the work. The resource provider service may update the record indicating that work is being performed. The resource provider service may archive and/or remove the record when it has expired.

Abstract: A computer-implemented method for parallel downloading of content includes connecting to a server through which a content is available, starting to download the content from the server to a client computer, determining whether to split the downloading of the content based on a set of factors, the set of factors comprising a network latency metric and a remaining download time to download a remaining amount of the content and based on a determination to split the downloading of the content, and in parallel to downloading a first part of the content from the server to the client computer, connecting to the server and downloading an additional part of the content from the server to the client computer.

Abstract: An operation method includes: dividing a model to be executed in an accelerator into a plurality of stages; determining, for each of the stages, a maximum batch size processible in an on-chip memory of the accelerator; determining the determined maximum batch sizes to each be a candidate batch size to be applied to the model; and determining, to be a final batch size to be applied to the model, one of the determined candidate batch sizes that minimizes a sum of a computation cost of executing the model in the accelerator and a memory access cost.

Abstract: A method and system disclosed dynamically throttling a rate or volume in time of a power user for avoiding throughput penalties imposed by SaaS vendors on a user group due to excessive Application Programming Interface (API) events from users in the group, monitoring API event rate for requests from the group, collectively, and from individual users of the user group to a SaaS vendor is disclosed. Also, identifying a power user as submitting API events in excess of a limit, and on behalf of the user, throttling the power user's rate of API events submissions, based on a configurable policy specific to the SaaS vendor managed by a proxy, to reduce the user's impact on the API event rate of the group at least when the group's API rate, overall, exceeds or approaches a SaaS imposed trigger of a throughput penalty on the group, thereby avoiding triggering of the throughput penalty by the SaaS.

Abstract: A method includes decoding, by at least one hardware processor, an enqueue request received from a data process of a database system. The enqueue request includes a task. The task is enqueued in an in-memory task queue. An enqueue acknowledgment is encoded for transmission to the data process responsive to the enqueue request. The task is persisted in a storage location associated with the in-memory task queue. Initiate a lease of the task to a worker node in response to a lease request received from the worker node. A dequeue request is received from the worker node where the dequeue request indicates completion of the task by the worker node. The task is dequeued from the in-memory task queue based on the dequeue request.

Abstract: Techniques for providing high-performance buffer caches for transactional input/output (I/O) systems are disclosed. The techniques include obtaining a first logical creation time of a resource to be acquired by the first transaction during a pre-commit phase of a first transaction with an I/O system. When the first logical creation time exceeds a latest logical creation time from a set of resources previously acquired by the first transaction, the first logical creation time of the resource is compared with an earliest logical termination time from the set of resources. When the first logical creation time of the resource exceeds the earliest logical termination time from the set of resources, a conflict between the resource and the set of resources is detected, and a restart of the first transaction is triggered.

Abstract: Chiplet systems may include a memory controller that has programmable atomic units that execute programmable atomic transactions. These instructions are stored in one or more memory partitions of memory in the programmable atomic unit. Since the programmable atomic unit executes programmable atomic transactions that are customized for various processes, and since the programmable atomic unit is a physical resource shared by multiple processes, the processes need a way of both loading the programmable atomic unit memory with instructions and a method of calling those instructions. Disclosed are methods, systems, and devices for registering, calling, and virtualizing programmable atomic transactions.

Abstract: Embodiments of the present disclosure relate to a memory controller and operating method thereof. According to embodiments of the present disclosure, the memory controller may generate a fused linked list which includes information of a plurality of write commands received from a host and a plurality of synchronization commands requesting a synchronization operation, and control the synchronization operation for one or more of the plurality of write commands based on the fused linked list.

Abstract: Embodiments provide systems and methods for securely transferring large objects. A computer-implemented method, for example, includes determining whether digital content captured by a content capture device currently qualifies as a large file for transmission, based on a size attribute and a current transmission parameter associated with currently transmitting objects from a content capture system to an enterprise content management system. If the digital content qualifies as a large file, the digital content is encrypted and transmitted to a decentralized storage system for storage, and a content identifier that identifies the encrypted digital content stored in the decentralized storage system is transmitted to the enterprise content management system. Otherwise, the digital content is transmitted from the content capture system to the enterprise content management system.

Abstract: A method comprises receiving from a distributed app (dApp), a shard creation transaction in a blockchain block of a blockchain, the block comprising multiple shards; collecting, with a join block in the blockchain, transactions, the join block adjacent the blockchain block; encapsulating the shard creation transaction; applying the block including the shard creation transaction to yield a new shard in the block; and broadcasting the block.

Abstract: A distributed computing system uses dynamically calculates a subset size for each of a plurality of load balancers. Each of a plurality of load balancers logs requests from client devices for connections to back-end servers and periodically sends a request report to a traffic aggregator, which aggregates the report requests from the load balancers in the corresponding zone. Each traffic aggregator sends the aggregated request data to a traffic controller, which aggregates the request data to determine a total number of requests received at the system. The total request data is transmitted through each traffic aggregator to each load balancer instance, which calculates a percentage of the total number of requests produced by the load balancer and determines a subset size based on the calculated percentage.

Abstract: Described herein is a computer-implemented method. The method comprises receiving an operation notification in respect of a gated operation from a change requesting system, determining an issue type associated with the gated operation, and creating an issue of the determined issue type. The method further comprises determining that the issue has transitioned state from a pending workflow state to a particular operation resolution workflow state and, in response, generating an operation resolution message which is communicated to the change requesting system.

Abstract: In some implementations, a device may determine whether an existing record for a file, received at a file storage location, is present in a record log. The device may generate, based on determining that the existing record for the file is not present in the record log, a record for the file in the record log. The record may identify the file and a first region. The device may determine, after generating the record, whether the record has been changed to identify a second region. The device may process the file based on determining that the record has not been changed to identify the second region.

Abstract: Systems and methods are disclosed for switching between batch processing and real-time processing of time series data, with a system being configured to switch between a batch processing module and a real-time processing module to process time series data. The system includes an orchestration service to indicate when to switch, which may be based on a switching event identified by the orchestration service. In some implementations, the orchestration service identifies a switching event in incoming time series data to be processed. When a batch processing module is to be used to batch process time series data, the real-time processing module may be disabled, with the real-time processing module being enabled when it is used to process the time series data. In some implementations, the real-time processing module includes the same processing models as the batch processing module such that the two modules' outputs have a similar accuracy.

Abstract: Technologies are described for managing shared read-only objects in hybrid distributed database systems. For example, data structures can be maintained for managing the shared read-only objects, comprising a data structure storing a “deleted at” value for each shared read-only object, a data structure storing a “deleted at” value for each secondary node, a data structure storing a indication of which secondary nodes are reading which shared read-only objects, and a data structure storing a reference count indicating a number of active read transactions for each shared read-only object. The shared read-only objects that can be garbage collected can be identified using, at least in part, the data structures. The identified shared read-only objects can then be garbage collected.

Abstract: Certain aspects of the present disclosure provide techniques for efficient data parity. Embodiments include receiving, by a first data consuming component, from a publication service, a plurality of database change records indicating changes to an underlying data source. Embodiments include updating, by the first data consuming component, a secondary data store based on the plurality of database change records. Embodiments include selecting a sample subset of the plurality of database change records based on one or more conditions. Embodiments include, for each respective database change record in the sample subset that has already been consumed by a second data consuming component that updated a primary data store based on one or more database change records: comparing the respective database change record to first data from the primary data store that corresponds to the respective database change record and making a parity determination based on the comparing.

Abstract: The disclosed embodiments provide a distributed transaction system including a group of validator nodes that are known to each other in a network but are indistinguishable to other network nodes. The validator nodes form a Committee including a Leader node and one or more Associate nodes configured to receive and process transaction requests and candidate requests, for example, to add new blocks to one or more blockchains. The Committee may be dynamically changed, such that new network nodes may be added to the Committee or may replace existing validator nodes. The Associate nodes also may coordinate with each other to select a new Leader node. The system may allow multiple request-fulfillment process to run simultaneously, thereby enhance the efficiency of the system.

Abstract: A clustered pair of storage systems configured for active-active bidirectional synchronous replication expose a stretched volume over paths to both storage systems. Writes to the stretched volume received at each system are replicated to the peer system. The cluster can use a time-to-live (TTL) mechanism by which a non-preferred system continuously requests a TTL grant from the preferred system to remain in the cluster. Algorithms that reduce or avoid data unavailability are described and can include assessing the health of the systems in the cluster. An unhealthy system can trigger a one-sided polarization algorithm to notify the peer system that it is polarization winner. An improved polarization technique using a witness to decide the polarization winner includes a system adding a time delay before contacting the witness if the system is unhealthy. A control component can detect an unhealthy system and disable the active-active bidirectional synchronous replication.

Abstract: Prior to initiating discovery of computing resources of an information technology (IT) infrastructure, an input query and a discovery job are received, and one or more trigger configuration items (CIs) are calculated. The input query specifies how the computing resources are discovered, and has a filter parameter. The discovery job is for the input query, has a job parameter, and is associated with a trigger query that is a subset of the input query. The trigger CIs are calculated based on the trigger query, such that the filter parameter of the input query is replaced with the job parameter in the trigger CIs. Discovery of the computing resources is initiated by dispatching each trigger CI. As discovery of the computing resources occurs, CIs representing the computing resources matching the trigger CIs are received, and the CIs are populated within a configuration management database (CMDB).

Abstract: An approach is disclosed for optimizing jobs, which involve effective data retrieval across multiple data sources, via an externalized query pattern. The approach receives a query. The approach allocates computing power to one or more computing nodes to process a job for the received query. The approach determines whether the job for the received query corresponds to an identifier indexed in a search engine. The approach retrieves, in response to determining the job for the received query corresponds to the indexed identifier, attribute data corresponding to the indexed identifier from the search engine. The approach provides a response to the received query request, in which the response includes the attribute data corresponding to the indexed identifier.

Abstract: Embodiments of the present disclosure provide methods, apparatus, systems, computer program products for providing a virtual network within an interactive electronic technical manual system (IETM) configured to provide electronic and credentialed access via an IETM viewer to technical documentation for an item. In one embodiment, a method is provided comprising: receiving data from a graphical code as a result of a user scanning the code; and responsive to receiving the data: identifying virtual networks supported within the IETM that are available for the user to join and are associated with a specific object of the item; providing an identifier for each of the virtual networks; receiving selection of an identifier for a particular virtual network; and responsive to receiving the selection, joining the user to the virtual network so that content that is specific to the object associated with the virtual network is available to the user via the IETM.

Abstract: A method includes monitoring a job being executed at the source mainframe. A job comprises multiple tasks. A method includes monitoring a particular task of the multiple tasks being executed at a source mainframe and determining an application required to execute the particular task. In response to determining that the particular task requires an application to execute, determining a target mainframe where the application is installed. A method further includes validating the environment of the target mainframe to confirm that the particular task can be executed using the target mainframe, and upon validating the target mainframe, redirecting the particular task to the target mainframe for execution. A method also includes monitoring the particular task being executed at the target mainframe and returning the results of the particular task from the target mainframe to the source mainframe.

Abstract: Aspects of the present invention disclose a method, computer program product, and system for auto-scaling a query engine. The method includes one or more processors monitoring query traffic at the query engine. The method further includes one or more processors classifying queries by a plurality of service classes based on a level of complexity of a query. The method further includes one or more processors comparing query traffic for each service class with a concurrency threshold of a maximum number of queries of the service class allowed to be concurrently processed. The method further includes one or more processors instructing auto-scaling of a cluster of worker nodes to change a number of worker nodes available in the cluster based on the comparison, over a defined period of time, of the query traffic relative to a defined upscaling threshold and a defined downscaling threshold.

Abstract: A system, computer-implemented method, and/or non-transitory computer-readable media may provide a warm start technique for cloud-hosted functions. Included is a non-transitory memory storage comprising instructions, and one or more processors in communication with the memory, wherein the one or more processors execute the instructions to identify a cloud-hosted function configured to be executed within a cloud computing environment. The cloud-hosted function is instantiated within the cloud-hosted computing environment.

Abstract: Embodiments of the present disclosure provide methods, apparatus, systems, computer program products for performing functionality requiring network connectivity in an interactive electronic technical manual system (IETM) configured to provide electronic and credentialed access to technical documentation for an item. In one embodiment, a method is provided comprising: receiving input comprising informational data; and responsive to receiving the data: generating a graphical security code; receiving input indicating a scanning of the code, wherein the scanning of the code (1) is performed by a user using a remote device connected to a network and (2) causes access to scanning functionality provided by an application installed on the device; and responsive to receiving the input: generating a graphical form code comprising the data; and causing display of a third window comprising the code, wherein the code can be scanned using the application to send the data to a third party over the network.

Abstract: Techniques for using tree data structures to maintain a transactionally consistent set with support for time-travel queries are described. When a transaction commits, a new version of the tree data structure is created using a copy-on-write based method such that the tree shares internal nodes with previous trees to save space. This approach may be used in the implementation of a transactional data catalog in which the files that make up a table are stored in a transactional set.