[현장기획] “실전형 국방무술의 필요성”-Ⅶ

구본근 월간군사저널 2024 월간군사 Vol.2024 No.4

장(長)-지방재정이 성장하다 : 특집 | 2016년 지방재정의 전망 및 운용방향: 03. 2016년 지방재정관리의 운용방향

구본근 한국지방재정공제회 2016 지방재정 Vol.2016 No.1

지난해 지방재정과 관련해 지방재정의 건정성 확보는 국가적 이슈였다. 그것은 올해 역시 마찬가지 키워드라 생각된다. 그렇다면 지방재정의 당면한 어려움을 극복하기 위해 어떤 노력을 하고 있는지 2016년 지방재정관리의 운용방향에 대해 알아보고, 그 방향에 맞춰 우리가 준비해야 할 것은 무엇인지 생각해 보도록 하자.

이기종으로 구성된 NOW 환경에서 preSend 부하 분할 알고리즘

具本根 충주대학교 산업대학원 2001 大學院論文輯 Vol.2 No.-

At NOW(Networks Of Workstations), the load sharing is very important role for improving the performance. The known load sharing strategy is fixed-granularity, variable-granularity, adaptive-granularity. The Send algorithm, which implements the fixed-granularity strategy, gets higher performance than other algorithms on NOW. But, in Send algorithm, the computing time and the communication time are not overlapped. Therefore, long latency time at the network has influence on the execution time of the parallel program. In the preSend algorithm, the master node can send the data to the slave nodes in advance without the waiting for partial results from the slaves. As the master node sent the nest data to the slaves in advance, the slave nodes can process the data without the idle time. As stated above, the preSend algorithm can overlap the computing time and the communication time. But, the preSend algorithm can not be used in heterogeneous NOW environment. In this paper, we propose the heterogeneous preSend algorithm. In heterogeneous preSend algorithm, the transmission time t_s and the computing time t_p for each slave are used to determine the delay time between the two consecutive data transmission at master node. Therefore the heterogeneous preSend algorithm is used in heterogeneous NOW environment composed of the heterogeneous nodes.

NOW 환경에서 preSend 알고리즘의 Java 구현

具本根 충주대 2001 한국교통대학교 논문집 Vol.36 No.2

In this paper, we propose the data server - calculation server model.In this model, the data server provides the data to the calculation server, and collects the results received from the calculation server.The calculation server performs the calculation using the data received from the data server, and returns the results of the calculations.We implement the proposed model using Java.We use the Java RMI(Remote Method Invocation) for exchanging the data and result values between the data server and the calculation server.The implementation in the paper adds the integers between 1 and 99,999 in NOW.The NOW in this paper consists two computers.We use MS-Windows 98, Linux and, JDK 1.3.1.We find that the proposed model is efficiently implemented using Java and Java RMI.

사용자 시선을 이용한 상황 정보

구본근 충주대학교 2006 한국교통대학교 논문집 Vol.41 No.-

In this paper, we propose the gaze direction context information. In many context-aware system, the services based on the user's locational information are provided. But we think that user firstly gazes at the object in which he is interested, and then he goes to that object. Therefore we propose and define the concept of the gaze proximity context. This context information is used to decide the service which the context-aware system provides user with. The context-aware system determines the gaze proximity context using the user's gaze direction and location information.

MDDS에서 디스크 서비스 시간 분석

具本根 충주대학교 산업대학원 1999 大學院論文輯 Vol.1 No.-

MDDS is the disk system to enhance the performance of disk system for hypercube. In MDDS,each node stores the disk blocks using the declustering technique. And the node also duplicates the disk blocks stored in neighboring nodes. In our previous research for MDDS, we propose the MDDS,Mirrored Declustering Disk System, which is the disk array system for hypercube. And we also analyze the probabilistic model for disk service at node. But the previous research do not provide the model for disk service time. In this paper, we analyze the disk service time. For analysis of the disk service time, we analyze the transmission time of the disk service request messages from the source node to the destination node. The disk service request message is the message for requesting the disk service, and is generated at the source node and transferred to the destination node. The disk service time consists of the transmission time of the disk service request messages, disk access time, and the transmission time of the disk service messages. We can analyze the transmission time of the disk service messages by using the transmission time analysis method of the request messages.

멀티미디어 서버를 위한 고성능 디스크 시스템

구본근 忠州大學校 1999 한국교통대학교 논문집 Vol.34 No.2

In this research we propose the RAID level-5g disk system for multimedia server. RAID level-5g consists of the disk groups. Each disk grop consists of the disks, and stores one media, such as moving pictures, sound, text, and etc. The disk access at each disk grop is independent of the disk access at other disk groups. Therefore disk access for multimedia data, consisting of multiple media data, are concurrently served in RAID level-5g. Because RAID level-5g can concurrently serve the disk access for many multimedia data request of the multimedia clients, it is possible to play the multimedia data with real-time manner in the clients.

반사된 분산 저장 디스크 시스템에서 디스크 서비스 요구 메시지 전송이 블록될 확률 분석

具本根 충주대 산업과학기술연구소 1998 産業科學論文集 Vol.6 No.-

In our previous research for MDDS, we propose the MDDS, Mirrored Declustering Disk System, which is the disk array system for hypercube. And we also analyze the probabilistic model for disk service at node. But previous research do not provide the model for disk service time. In this paper we analyze the probability of blocking the message related to the disk service request. To analyze the probability of blocking, we analyze the blocking time at the link. The probability of blocking is used to analyze the disk service time.

NOW환경에서 효율적인 부하 분할

具本根 충주대 2000 한국교통대학교 논문집 Vol.35 No.2

At NOW(Networks Of Workstations), the load sharing is very important role for improving the performance.The known load sharing strategy is fixed-granularity, variable-granularity, adaptive-granularity.The send algorithm, which implements the flexed-granularity strategy, gets higher performance than other algorithms on NOW.But, in Send algorithm, the computing time and the communication time are not overlapped.Therefore, long latency time at the network has influence on the execution lime of the parallel program.In this paper, we propose the preSend algorithm.In the preSend algorithm, the computing time and the communication time are overlapped.Therefore we reduce the influence of the long latency time at the network and enhance the performance of the NOW.

이기종 클러스터를 위한 TSC 부하 분할 알고리즘

具本根 충주대 2003 産業科學論文集 Vol.11 No.-

Cluster is the cost-effective parallel processing system. In this paper, we propose the TSC load sharing algorithm for the heterogeneous cluster composed of nodes having the different configurations. To share the load, TSC algorithm uses the processor performance fo node.Therefore, TSC algorithm effectively distributes the load to the nodes in the heterogeneous cluster. To show the effectiveness of TSC algorithm, we write the parallel programs for the matrix multiplication and the Mandelbrot set. And we compare the TSC with other load sharing algorithms-Send, GSS. The results of our experiments shows that TSC is more effective load sharing algorithm than Send, GSS. The space-time diagrams of parallel programs show that TSC distributes the load to nodes fairly. Therefore, TSC load sharing algorithm can enhance the performance of heterogeneous cluster by effectively sharing the load.