International Business Machines Corporation

Au Optronics Corporation

Sap Se

Sap Ag

Moriyoshi Ohara

Hideaki Komatsu

Hiroshi Inoue

Takuya Nakaike

Kazuaki Ishizaki

Takao Moriyama

Yukihiko Sohda

Sanehiro Furuichi

Takenori Kohda

Angel Nunez Mencias

Kiyokuni Kawachiya

Mikio Takeuchi

Kei Kawase

Takanori Ueda

Jan M Wroblewski

Christian Jacobi

Marcel Mitran

Venkatraman Ramakrishna

Stefan Liesche

Tatsushi Inagaki

Yohei Ueda

Christopher S Smith

James Robert Magowan

Chun Hui Suen

Yu Chin Fabian Lim

Shigenori Shimizu

Katashi Nagao

Peter James De Meo

An example operation may include one or more of storing one or more public keys of one or more policy services, receiving, via a signing service, a blockchain transaction that has content that has been verified by a policy service and includes a signature created by a private key of the policy service, verifying, via a hardware security module (HSM), the signature of the policy service based on a public key of the policy service from among the one or more public keys, and in response to a verification of the signature of the policy service, signing, via the HSM, the blockchain transaction using a wallet key of a user of the blockchain transaction.

Digital asset platform with HSM verification

Securing pods in a container orchestration environment is provided. A container runtime interface command is verified to perform an orchestration action on a set of containers comprising an application workload that corresponds to a service based on matching the container runtime interface command to a rule contained in a trusted execution environment contract included in a pod sandbox virtual machine of a trusted execution environment. It is determined whether the container runtime interface command to perform the orchestration action on the set of containers is valid based finding a matching rule in the trusted execution environment contract. In response to determining that the container runtime interface command to perform the orchestration action on the set of containers is valid, the container runtime interface command is executed to perform the orchestration action on the set of containers in the pod sandbox virtual machine of the trusted execution environment.

Securing pods in a container orchestration environment

A computer-implemented scaling method, an apparatus, and a computer program product for detecting whether a performance of a system reaches a target performance are provided. The method includes scaling a layered software environment, including scaling a first layer software environment in the layered software environment in response to the performance of the system not reaching the target performance and scaling a second layer software environment that is above the first layer software environment in the layered software environment in response to the performance of the system not reaching the target performance despite the first layer software environment being scaled. The method also includes scaling hardware resources used for executing the layered software environment in the system in response to the performance of the system not reaching the target performance before scaling of the first layer software environment or after scaling of the second layer software environment.

Multi-layer autoscaling for a scale-up cloud server

A method includes identifying a code portion that accesses a primitive value in a user-defined function included in a user program, converting the code portion and an argument in a manner to directly reference an internal data representation of the user program, and generating a code for calling the user-defined function converted by the conversion.

Program optimization by converting code portions to directly reference internal data representations

A method is provided for building calling context trees of an application to identify a thread or a device affecting a throughput of a transaction relating to the application. The method obtains profiles of call stacks of multiple threads. The method obtains wake-up profiles which are the call stacks of a notifier thread and a waiter thread, from among the multiple threads, in a case that the waiter thread leaves from a sleep state. The method builds the calling context trees to indicate transitions of methods tracing callee relations and wake-up relations based on the profiles of the call stacks and the wake-up profiles, wherein each method is represented by a node having an average thread number. The method extracts and displays tree portions which are transitively reachable from a calling context tree for the transaction and which include the thread or device affecting throughput.

Identifying software and hardware bottlenecks

A computer-implemented method is provided for processing requests among microservices in a computer network. The method includes generating, by a processor, a method to return a body of a response from an Application Programming Interface (API) that aggregates the requests among the microservices to form aggregated requests. The method further includes generating, by the processor, another API that automatically receives the aggregated requests from the API by receiving an array of parameters of the original API and calling the method using each of the parameters of the array as a call parameter for the method. The method also includes optimizing, by the processor, a number of aggregated requests in a network layer of the computer network based on a wait time and a response time to receive and transfer requests between micro services.

Aggregating requests among microservices

Methods and systems for optimizing an application include optimizing, with a processor on a first device, an application for a second device in accordance with an application execution profile received from the second device to generate a binary for the application that is optimized for use indicated by the application execution profile. The optimized binary is set to be a default application binary, to be sent to devices requesting the application for a first time, if a percentage of matching application profiles exceeds a threshold. The optimized binary for the application is transmitted to the second device.

Profile-based per-device code optimization

Methods and systems for optimizing an application include optimizing, with a processor on a first device, an application for a second device in accordance with an application execution profile received from the second device to generate a binary for the application that is optimized for use indicated by the application execution profile. The optimized binary is transmitted to the second device.

A thread priority control mechanism is provided which uses the completion event of the preceding transaction to raise the priority of the next transaction in the order of execution when the transaction status has been changed from speculative to non-speculative. In one aspect of the present invention, a thread-level speculation mechanism is provided which has content-addressable memory, an address register and a comparator for recording transaction footprints, and a control logic circuit for supporting memory synchronization instructions. This supports hardware transaction memory in detecting transaction conflicts. This thread-level speculation mechanism includes a priority up bit for recording an attribute operand in a memory synchronization instruction, a means for generating a priority up event when a thread wake-up event has occurred and the priority up bit is 1, and a means for preventing the CAM from storing the load/store address when the instruction is a non-transaction instruction.

Parallel execution mechanism and operating method thereof

A method and apparatus are provided to perform efficient merging operations of two or more streams of data by using SIMD instruction. Streams of data are merged together in parallel and with mitigated or removed conditional branching. The merge operations of the streams of data include Merge AND and Merge OR operations.

Merging sorted data arrays based on vector minimum, maximum, and permute instructions

Data transfer during processor context switching is reduced, particularly in relation to a time-sharing microtasking programming model. Prior to switching context of a processor having local memory from a first to a second process, a portion of the local memory that does not require transfer to system memory for proper saving of data associated with the first process is determined. The context of the processor is then switched from the first to the second process, including transferring all of the local memory as the data associated with the first process, to system memory&#x2014;except for the portion of the local memory that has been determined as not requiring saving to the system memory for proper saving of the data associated with the first process. Therefore, switching the context from the first to the second process results in a reduction of data transferred from the local memory to the system memory.

Reduced data transfer during processor context switching

A converter for converting an application program that is executed for every job request into a batch processing program for collectively processing a plurality of job requests. The converter includes: a code identifier for identifying a portion of the application program that includes a service request to another server, and a portion that does not include a service request; an integration unit for converting the service request into a collective service request that collectively issues a plurality of service requests corresponding to the plurality of job requests; a multiplexing unit for converting the processing code in the application program into a multiplexed code for executing multiple processings corresponding to the plurality of job requests; and an output unit for outputting, as the batch processing program, the application program that the integration unit and the multiplexing unit have processed.

Converter, server system, conversion method and program

A computer-implemented method, apparatus, and computer program-product for controlling cache. The method includes the steps of assigning a value corresponding to a transaction to a memory object that is created while a computer application is processing the transaction; adding the assigned value as a transaction flag value to a flag area of a cache array in accordance with the storage of the memory object in the cache; registering the corresponding transaction flag value as a victim candidate at the completion of the transaction; and in response to eviction of a cache line, preferentially evicting a cache line having the transaction flag value registered as the victim candidate.

Growing community of inventors

Kanagawa-ken, Japan

Moriyoshi Ohara