• Journal of KIISE:Computer Systems and Theory
• /
• v.26 no.11
• /
• pp.1318-1332
• /
• 1999

본 논문에서는 입출력 응용을 위해 collective I/O 기법을 기반으로 한 실행시간 시스템의 설계, 구현 그리고 그 성능평가를 기술한다. 여기서는 모든 프로세서가 동시에 I/O 요구에 따라 스케쥴링하며 I/O를 수행하는 collective I/O 방안과 프로세서들이 여러 그룹으로 묶이어, 다음 그룹이 데이터를 재배열하는 통신을 수행하는 동안 오직 한 그룹만이 동시에 I/O를 수행하는 pipelined collective I/O 등의 두 가지 설계방안을 살펴본다. Pipelined collective I/O의 전체 과정은 I/O 노드 충돌을 동적으로 줄이기 위해 파이프라인된다. 이상의 설계 부분에서는 동적으로 충돌 관리를 위한 지원을 제공한다. 본 논문에서는 다른 노드의 메모리 영역에 이미 존재하는 데이터를 재 사용하여 I/O 비용을 줄이기 위해 collective I/O 방안에서의 소프트웨어 캐슁 방안과 두 가지 모형에서의 chunking과 온라인 압축방안을 기술한다. 그리고 이상에서 기술한 방안들이 입출력을 위해 높은 성능을 보임을 기술하는데, 이 성능결과는 Intel Paragon과 ASCI/Red teraflops 기계 상에서 실험한 것이다. 그 결과 응용 레벨에서의 bandwidth는 peak point가 55%까지 측정되었다.Abstract In this paper we present the design, implementation and evaluation of a runtime system based on collective I/O techniques for irregular applications. We present two designs, namely, "Collective I/O" and "Pipelined Collective I/O". In the first scheme, all processors participate in the I/O simultaneously, making scheduling of I/O requests simpler but creating a possibility of contention at the I/O nodes. In the second approach, processors are grouped into several groups, so that only one group performs I/O simultaneously, while the next group performs communication to rearrange data, and this entire process is pipelined to reduce I/O node contention dynamically. In other words, the design provides support for dynamic contention management. Then we present a software caching method using collective I/O to reduce I/O cost by reusing data already present in the memory of other nodes. Finally, chunking and on-line compression mechanisms are included in both models. We demonstrate that we can obtain significantly high-performance for I/O above what has been possible so far. The performance results are presented on an Intel Paragon and on the ASCI/Red teraflops machine. Application level I/O bandwidth up to 55% of the peak is observed.he peak is observed.

• Journal of the Institute of Electronics Engineers of Korea CI
• /
• v.42 no.1
• /
• pp.9-26
• /
• 2005

In the pursuit of ever higher levels of performance, recent computer systems have made use of deep pipeline, dynamic scheduling and multi-issue superscalar processor technologies. In this situations, branch prediction schemes are an essential part of modem microarchitectures because the penalty for a branch misprediction increases as pipelines deepen and the number of instructions issued per cycle increases. In this paper, we propose a novel branch prediction scheme, direction-gshare(d-gshare), to improve the prediction accuracy. At first, we model a neural network with the components that possibly affect the branch prediction accuracy, and analyze the variation of their weights based on the neural network information. Then, we newly add the component that has a high weight value to an original gshare scheme. We simulate our branch prediction scheme using Simple Scalar, a powerful event-driven simulator, and analyze the simulation results. Our results show that, compared to bimodal, two-level adaptive and gshare predictor, direction-gshare predictor(d-gshare. 3) outperforms, without additional hardware costs, by up to 4.1% and 1.5% in average for the default mont of embedded direction, and 11.8% in maximum and 3.7% in average for the optimal one.

• Journal of KIISE:Software and Applications
• /
• v.32 no.11
• /
• pp.1021-1028
• /
• 2005

The general solution for classification and regression problems can be found by matching and modifying matrices with the information in real world and then these matrices are teaming in neural networks. This paper treats primary space as a real world, and dual space that Primary space matches matrices using kernel. In practical study, there are two kinds of problems, complete system which can get an answer using inverse matrix and ill-posed system or singular system which cannot get an answer directly from inverse of the given matrix. Further more the problems are often given by the latter condition; therefore, it is necessary to find regularization parameter to change ill-posed or singular problems into complete system. This paper compares each performance under both classification and regression problems among GCV, L-Curve, which are well known for getting regularization parameter, and kernel methods. Both GCV and L-Curve have excellent performance to get regularization parameters, and the performances are similar although they show little bit different results from the different condition of problems. However, these methods are two-step solution because both have to calculate the regularization parameters to solve given problems, and then those problems can be applied to other solving methods. Compared with UV and L-Curve, kernel methods are one-step solution which is simultaneously teaming a regularization parameter within the teaming process of pattern weights. This paper also suggests dynamic momentum which is leaning under the limited proportional condition between learning epoch and the performance of given problems to increase performance and precision for regularization. Finally, this paper shows the results that suggested solution can get better or equivalent results compared with GCV and L-Curve through the experiments using Iris data which are used to consider standard data in classification, Gaussian data which are typical data for singular system, and Shaw data which is an one-dimension image restoration problems.

• Journal of Korean Academy of Nursing Administration
• /
• v.1 no.1
• /
• pp.132-146
• /
• 1995

Even though Korean medical law stipulates that number of patients attended by a nurse is 2.5 for hospitalization and 30 for ambulatory care, the number of patients cared by a nurse per day is much greater than the standard prescribed by the medical law. Current productivity of nurses is not desirable unless the quality of care is considered. And nursing manpower staffing based on neither current nurses' productivity nor standard of medical law cannot respond properly to dynamic situation of the medical services. Under this background, the necessity of more efficient management of nursing manpower occupying 1/3 of total hospital workers has been recognized by many nursing administrators. Many nursing researchers have studied to foretell the nursing manpower objectively on the basis of measured nursing workload according to patient classification as well. Most of These researches, however, have been conducted in the tertiary hospitals, so it is imperative to conduct other researches to predict necessary nursing manpower in the secondary and the primary hospitals. The study was performed to measure nursing workload and predict pertinent nursing manpower to a secondary hospital with 400beds. Nursing workload was surveyed using measuring tool for direct and indirect care hours in a surgical unit and a medical unit. Survey was conducted from Sep.10 to Sep.16 and from Oct.5 to Oct.11, 1994 respectively by two skilled nurses, Subjects were patients, patients' family members and nursing personnels. Results are follows : 1. Patient classification distributed as 22% of class I (mildly ill patient), 57% of class II (moderately ill patient), and 21% of class III (acutely ill patient) in the medical nursing unit, while 23% of class I, 29% of class II, 12% of class III, and 36% of classIV (critically ill patient) in the surgical nursing unit. There was no difference of inpatient number between weekday and weekend. Bed circulation rate was 89% in both units and average patients number per day was 37.4 (total 42beds) in the medical nursing unit, 32.9 (total 37beds) in the medical nursing unit. 2. Direct care hours per day measured as 2.8hrs for class I, 3.3hrs for class II, and 3.5hrs for class III in the medical nursing unit, while 3.1hrs for class I, 3hrs for class II, 2.7hrs for class III, and 2.2hrs for classIV in the surgical nursing unit. Meanwhile, hours for nursing assistant activities per patient by patients' family members were 11mins and 200mins respectively. Direct care hour rate by shift was day 36%, evening 25%, and night 39% in the medical nursing unit, while 40%, 29%, and and 31% respectively in the surgical nursing unit. 3. Measurement and observation activity held 44.2% of direct care activities of nurses and medication 36.7%, communication 11.7%, exercise 1.8%, treatment 1.3%, hygiene 1.3%, elimination and irrigation 1.1%, suction 1%, nutrition 0.5%, thermotherapy 0.3%, oxygen therapy 0.1% in order. 4. Indirect care hours per day were 294.2mins in the medical nursing unit, and 273.9mins in the surgical nursing unit. By shift, evening was the highest in both units. Indirect care hours for each patient were 44.5mins in the medical nursing unit and 46mins in the surgical nursing unit. 5. checking activities including doctor's order, medication, and delivering patients to the next shift occupied 39.7% of indirect care activities, and preparation 26%, recording 23.8%, communication and conference 6.7%, managing equipments 2.1%, messenger activity 1.7% in order. 6. On the ground of these results, nursing manpower needed in a secondary hospital was estimated ; 27 nursing personnels for the medical nursing unit of 37beds, and 20 nursing personnels for the surgical nursing unit of 33beds.