TL;DR: This paper proposes a scheme, IOrchestrator, to improve I/O performance of multi-node storage systems by orchestratingI/O services among programs when such inter-data-server coordination is dynamically determined to be cost effective.
Abstract: A cluster of data servers and a parallel file system are often used to provide high-throughput I/O service to parallel programs running on a compute cluster. To exploit I/O parallelism parallel file systems stripe file data across the data servers. While this practice is effective in serving asynchronous requests, it may break individual program's spatial locality, which can seriously degrade I/O performance when the data servers concurrently serve synchronous requests from multiple I/O-intensive programs. In this paper we propose a scheme, IOrchestrator, to improve I/O performance of multi-node storage systems by orchestrating I/O services among programs when such inter-data-server coordination is dynamically determined to be cost effective. We have implemented IOrchestrator in the PVFS2 parallel file system. Our experiments with representative parallel benchmarks show that IOrchestrator can significantly improve I/O performance-- by up to a factor of 2.5--delivered by a cluster of data servers servicing concurrently-running parallel programs. Notably, we have not observed any scenarios in which the use of IOrchestrator causes substantial performance degradation.
TL;DR: In this paper, a technique for software updating of servers that reduces the unavailability of network resources due to the update process is presented. But this technique requires the implementation of proxy software in servers that are to be updated.
Abstract: A method and apparatus for updating inter-server communication software in a network are provided. More particularly, the invention is directed to a technique for software updating of servers that reduces the unavailability of network resources due to the update process. In this regard, the method includes the implementation of proxy software in servers that are to be updated. The servers are then selectively updated (e.g. one server at a time) in a manner, using the proxy software, to allow the servers to communicate with one another during the entire update process.
TL;DR: In this article, a client can request a job later from a specified managing server to respective execution servers while decomposing the execution requests of respective jobs only by simply requesting continuous procedures to this managing server without requesting the execution of respective tasks from a client, which requests the plural continuous procedures, to the execution servers.
Abstract: PROBLEM TO BE SOLVED: To request a job later from a specified managing server to respective execution servers while decomposing the execution requests of respective jobs only by simply requesting continuous procedures to this managing server without requesting the execution of respective jobs from a client, which requests the plural continuous procedures, to the execution servers for every processing. SOLUTION: In a computer system connected to respective lines 10, corresponding to the plural continuous procedures from the client, a managing server 31 determines the analysis of respective procedures and the execution procedure at the request destination and after the job control sentence of the leading job is generated, the execution is requested to execution servers 32-3n. At the execution server, the end of the requested server job is waited, the succession information or output file to the next server job are returned to the managing server 31. Based on this result, the managing server 31 generates the next job control sentence and requests the execution to the next execution server. By repeating this operation, the managing server 31 completes the request from the client.
TL;DR: In this paper, the inter-server data association device which performs data association with plural reception-side servers on the basis of data sent from one transmission-side server is presented.
Abstract: PURPOSE:To provide the inter-server data association device which performs data association with plural reception-side servers on the basis of data sent from one transmission-side server CONSTITUTION:Transaction information on data base operation which is sent from a main center 2 is received by an acquisition part 11 in the inter-server data association device 1 The data received by this acquisition part 11 are transferred to respective distribution buffers 12a in a distribution part 12 The distribution part 12 has information regarding the timing of data transmission that respective reception-side servers 3 require Therefore, the distribution part 12 transfers the transaction information, stored in the distribution buffers 12a corresponding to the respective reception-side servers 3, to the respective reception-side servers 3 at the points of time that the respective reception-side servers 3 requests them
TL;DR: In this paper, a method and system for sending notifications from servers of a server pool to clients is provided, which determines when an in-band notification is to be sent to clients.
Abstract: A method and system for sending notifications from servers of a server pool to clients is provided. The notification system determines when an in-band notification is to be sent to clients. The notification system identifies a distinguished server for each client that is to send the in-band notification to that client. The notification system then sends an out-of-band notification to the distinguished server of each client indicating that an in-band notification is to be sent to the client. When the distinguished server receives the out-of-band notification, the distinguished server then sends an in-band notification to the client.