![]() ![]() ![]() | ![]() |
|
![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() |
Note: Links lead to the DBLP on the Web. Daeyeon Park Byoung-Jip Kim , Kyungbaek Kim , Daeyeon Park: The Content-Aware Caching for Cooperative Transcoding Proxies. ICOIN 2005 : 766-775 Jaesun Han , Daeyeon Park: Scheduling Proxy: Enabling Adaptive-Grained Scheduling for Global Computing System. GRID 2004 : 415-420 Eungshin Kim , Jaesun Han , Daeyeon Park: TAP: Topology-Aware Peer-to-Peer Network with Expanding-Area Lookup. HSNMC 2004 : 985-994 YongJoo Song , Daeyeon Park: Infrastructure Support for Ad Hoc Network: When and Where? ICPP Workshops 2004 : 141-147 Woo Jin Kim , Kyungbaek Kim , Jaesun Han , Keuntae Park , Daeyeon Park: Thread-Aware Garbage Collection for Server Applications. SAINT 2004 : 81-90 Woo Hyun Ahn , Woo Jin Kim , Daeyeon Park: Content-aware cooperative caching for cluster-based web servers. Journal of Systems and Software 69 (1-2): 75-86 (2004) Sangho Park , Daeyeon Park: Adaptive Core Multicast Routing Protocol. Wireless Networks 10 (1): 53-60 (2004) Kyungbaek Kim , Woo Jin Kim , Daeyeon Park: Efficient and Scalable Client-Clustering for Proxy Cache. HSNMC 2003 : 83-92 Jaesun Han , Keuntae Park , Woo Jin Kim , Daeyeon Park: A Fast and Highly Adaptive Peer-to-Peer Lookup System for Medium-Scale Network. ISCC 2003 : 1041-1046 Kyungbaek Kim , Daeyeon Park: Subway: Peer-to-Peer Clustering Of Clients for Web Proxy. PDPTA 2003 : 1683-1688 Youngbae An , Daeyeon Park: Scalable Web Server Cluster System Using Content-Aware Packet Filtering. PDPTA 2003 : 721-730 Jaesun Han , Daeyeon Park: A Lightweight Personal Grid Using a Supernode Network. Peer-to-Peer Computing 2003 : 168-175 Woo Hyun Ahn , Kyungbaek Kim , Yongjin Choi , Daeyeon Park: DFS: A De-Fragmented File System. MASCOTS 2002 : 71-80 Jaesub Kim , Daeyeon Park: Dynamic Contents Clustering for the Disk I/O Enhancement in Web Proxy Servers. PDPTA 2002 : 1179-1186 Yongjoo Song , Yongjin Choi , Daeyeon Park: Traffic Load Balancing for Ad Hoc On-demand Routing Protocols. PDPTA 2002 : 829-835 Jin Soo Jang , Woo Hyun Ahn , Daeyeon Park: A Server Framework for Scheduling Multimedia Applications in Open System Environment. ICPADS 2001 : 562-572 Kyungbaek Kim , Daeyeon Park: Least Popularity-per-Byte Replacement Algorithm for a Proxy Cache. ICPADS 2001 : 780-788 Yangwoo Roh , JaeWoong Chung , Cheol Ho Park , Daeyeon Park: Efficient Fine-Grain Sharing Support for Software DSMs Through Segmentation. IPDPS 2001 : 64 Daeyeon Park, Byeong Hag Seong , Rafael H. Saavedra : Adaptive software prefetching in scalable multiprocessors using cache information. Parallel Computing 27 (9): 1173-1195 (2001) Cheol Ho Park , JaeWoong Chung , Byeong Hag Seong , YangWoo Roh , Daeyeon Park: Boosting superpage utilization with the shadow memory and the partial-subblock TLB. ICS 2000 : 187-195 Jaesun Han , Daeyeon Park: Socket-Level Redirection Mechanism for Scalable Internet Server System. International Conference on Internet Computing 2000 : 211-218 Cheol Ho Park , Jong Hyuk Choi , Kyu Ho Park , Daeyeon Park: An Adaptive Limited Pointers Directory Scheme for Cache Coherence of Scalable Multiprocessors. Euro-Par 1999 : 753-756 JaeWoong Chung , Byeong Hag Seong , Kyu Ho Park , Daeyeon Park: Moving Home-Based Lazy Release Consistency for Shared Virtual Memory Systems. ICPP 1999 : 282-290 Daeyeon Park, Rafael H. Saavedra : Trojan: A High-Performance Simulator for Shared Memory Architectures. Annual Simulation Symposium 1996 : 44-53 Rafael H. Saavedra-Barrera , Weihua Mao , Daeyeon Park, Jacqueline Chame , Sungdo Moon : The Combined Effectiveness of Unimodular Transformations, Tiling, and Software Prefetching. IPPS 1996 : 39-45 1 [ 10 ] [ 13 ] [ 20 ] 2 [ 15 ] 3 [ 1 ] 4 [ 4 ] 5 [ 11 ] [ 13 ] 6 [ 3 ] [ 6 ] [ 8 ] 7 [ 5 ] [ 14 ] [ 17 ] [ 21 ] [ 23 ] [ 24 ] 8 [ 10 ] 9 [ 25 ] 10 [ 23 ] 11 [ 12 ] 12 [ 9 ] [ 13 ] [ 16 ] [ 18 ] [ 21 ] [ 25 ] 13 [ 17 ] [ 18 ] [ 20 ] [ 21 ] 14 [ 1 ] 15 [ 1 ] 16 [ 4 ] [ 6 ] [ 8 ] 17 [ 17 ] [ 21 ] 18 [ 3 ] [ 4 ] 19 [ 19 ] 20 [ 6 ] 21 [ 8 ] 22 [ 2 ] [ 7 ] 23 [ 1 ] 24 [ 3 ] [ 6 ] [ 7 ] 25 [ 22 ] 26 [ 11 ] ![]() ©2005 Association for Computing Machinery |