http://chineseinput.net/에서 pinyin(병음)방식으로 중국어를 변환할 수 있습니다.
변환된 중국어를 복사하여 사용하시면 됩니다.
유전자 알고리즘을 이용한 광상호연결망에서 파장분할다중방식의 리스트 스케쥴링
정혜진(Jung Hea Jin),위규범(Wee Kyun Bum),예흥진(Yeh Hong Jin),홍만표(Hong Man Pyo),변광준(Byeon Kwnag June) 한국정보처리학회 1998 정보처리학회논문지 Vol.5 No.9
The problem of scheduling general packet traffic on WDM optical interconnection networks is NP-complete. It is known that the list scheduling is a good approximation algorithm for this problem. The resulting list schedules vary depending on the order of transmitters considered to be placed on each time slot. We propose an improvement of the list scheduling that tries different orders of transmitters to obtain shorter schedule lengths. Genetic algorithms are used to explore various orders of transmitters.
위규범(Wee Kyun Bum),예흥진(Yeh Hong Jin) 한국정보처리학회 1998 정보처리학회논문지 Vol.5 No.9
We present a linear time algorithm for finding a lexicographically minimal circular string in a given string. The problem was motivated by an effort to implement state transition functions in isotropic cellular automata. A native algorithm for the problem would require quadratic time. The proposed algorithm runs in linear time by keeping the result of comparisons of substrings and reusing it afterwards when the same computation is needed.
Passive Star 형 광상호연결망에서의 All-to-all 방송을 위한 송수신 스케쥴링 기법
장석문(Chang Seok Mun),변광준(Byeon Kwnag June),예흥진(Yeh Hong Jin),위규범(Wee Kyun Bum),홍만표(Hong Man Pyo) 한국정보처리학회 1998 정보처리학회논문지 Vol.5 No.8
In optical passive star interconnections, all packets are transmitted between nodes in a broadcast-and-select manner. It is assumed that each node has a tunable transmitter and a fixed-wavelength receiver, and that all packet lengths are equal so that each transmission can be done in a unit time. The tuning delay, denoted by δ, means the amount of time for a transmitter to change its wavelength to another one. The problem is, given any value of the number of nodes N and the number of wavelengths k according to WDM implementations, to find transmission schedules with minimum cycle length for all-to-all broadcast where no one sends any packet to itself. In this paper, we prove that the cycle length of optimal transmission schedules should be at least max{N/k(N-1), kδ N-1}. A novel algorithm for optimal transmission schedules is then presented when N-1 is divisible by k. This algorithm also can be used for any values of N and k if the tuning delay δ does not affect strictly the cycle length of transmission schedules, i.e. N/k(N-1) > kδ N-1.