Tmaxsoft Co., Ltd.

Kyung Koo Yoon

Moon Namkoong

Kyoung Min Ryoo

Hee Jin Lee

Jun Soo Jeong

A method for increasing throughputs of multiple services processed by multiple threads on conditions that the multiple services include at least a first, a second, and a third services and the multiple threads include at least a first and a second thread including steps of: (a) if the first service being processed by the first thread calls the second service, supporting the second thread to process the second service; and (b) while the second service is being processed, supporting the first thread to process the third service; and (c) if the processing of the second service is completed, supporting (i) the first thread or (ii) one or more other threads except the first thread to resume a processing of an unprocessed part of the first service, by using a result value acquired by the processing of the second service.

Method and computing device for increasing throughputs of services processed by threads

A method for clustering objects distributed in multiple servers to allow one or more distributed objects to be used as if they were one object is provided. The method includes steps of: (a) a specific server transmitting to a client a remote controller including a particular communication object capable of supporting communications between the client and the specific server; and (b) the specific server supporting the client to include at least one communication object, capable of supporting communications between the client and at least one server, respectively, except the specific server within the cluster, in the remote controller, to thereby support the client to be communicable with all the servers in the cluster by acquiring, and providing to the client, the at least one communication object by referring to information on all the servers within the cluster.

Method and system for clustering distributed objects to use them as if they were one object

A method for managing a thread pool size dynamically using elemental task throughputs is provided. The method includes steps of: a computing device (a) calculating a first representative task throughput corresponding to a first group including elemental task throughputs during the first time section, and then increasing a maximum thread value for the first time section and setting it as a maximum thread value for the second time section; (b) calculating a second representative task throughput corresponding to a second group including elemental task throughputs during the second time section; and (c) comparing the first and the second representative task throughput and then, if the latter is greater than the former by an amount equal to or greater than a preset first threshold value, increasing the maximum thread value for the second time section and setting it as a maximum thread value for a third time section.

Method and computing device for managing size of thread pool dynamically

Disclosed is a computer program stored in a computer-readable medium performing correlation matching for an early-arrived-message. The computer program allows a computer to perform the following steps and the steps include transmitting a message; registering a listener; determining whether an early-arrived-message is present by checking an early-arrived-message map; and performing correlation matching of the listener and the message when the early-arrived-message is present, in which the listener performs correlation matching with the message and when the correlation matching is performed, the listener permits a process based on the message to be performed.

Computer program and computing device for performing correlation matching for early-arrived-message

A method for managing a size of a thread pool dynamically is disclosed. The method includes the steps of: (a) a processor increasing a maximum thread size if the number of threads included in the thread pool is close to the maximum thread size; and (b) the processor comparing a size of a task queue before the increase of the maximum thread size with that after the increase thereof by referring to information on the size of the task queue, and increasing the maximum thread size again if the size of the task queue after the increase thereof is larger than, or equal to, that before the increase thereof.

Growing community of inventors

Gyeonggi-do, South Korea

Kyung Koo Yoon