{'fraction_non_alphanumeric': 0.02599009900990099, 'fraction_numerical': 0.01670792079207921, 'mean_word_length': 5.291828793774319, 'pattern_counts': {'":': 0, '<': 0, '<?xml version=': 0, '>': 0, 'https://': 0, 'lorem ipsum': 0, 'www.': 1, 'xml': 0}, 'pii_count': 0, 'substrings_counts': 0, 'word_list_counts': {'cursed_substrings.json': 0, 'profanity_word_list.json': 0, 'sexual_word_list.json': 0, 'zh_pornsignals.json': 0}}
Relaxed conditions of exchange on mechanism for exchanging parts of executed program

We proposed a control method for exchanging parts of an executing program. By applying this exchange method to a shared library that is linked dynamically, the contents of library functions that constitute the program can be changed without stopping processes that are providing services. In other words, maintenance tasks can be dynamically performed without suspending the services that are being provided. However, the program parts that are exchanged according to the proposed exchange method must satisfy strict exchange conditions, making it difficult to create program parts that are to be exchanged. Therefore, in this paper, we describe an exchange method in which the exchange conditions have been relaxed. Also, we point out a problem in which relaxing the exchange conditions causes the exchanging time to be significantly increased when exchanging parts for a program that is mainly a CPU-bound program compared with a program that is mainly an I/O-bound program. Then, to deal with this problem, we propose methods of devising process scheduling mechanisms to shorten the exchanging time. Specifically, we show a mechanism that temporarily suspends exchangeable processes early and a mechanism that preferentially executes unexchangeable processes. In addition, we implement and evaluate both of these mechanisms and show the effectiveness of each mechanism. © 2003 Wiley Periodicals, Inc. Syst Comp Jpn, 34(10): 13–25, 2003; Published online in Wiley InterScience (www.interscience.wiley.com). DOI 10.1002/scj.10423