Design and implementation of a remote procedure call with rendezvous approach랑데뷰 기법의 Remote procedure call 의 설계 및 구현
| DC Field | Value | Language |
|---|---|---|
| dc.contributor.advisor | Chon, Kil-Nam | - |
| dc.contributor.advisor | 전길남 | - |
| dc.contributor.author | Kim, Yu-Jin | - |
| dc.contributor.author | 김유진 | - |
| dc.date.accessioned | 2011-12-13T05:49:11Z | - |
| dc.date.available | 2011-12-13T05:49:11Z | - |
| dc.date.issued | 1985 | - |
| dc.identifier.uri | http://library.kaist.ac.kr/search/detail/view.do?bibCtrlNo=64581&flag=dissertation | - |
| dc.identifier.uri | http://hdl.handle.net/10203/33608 | - |
| dc.description | 학위논문(석사) - 한국과학기술원 : 전산학과, 1985.2, [ 1책(면수복잡) ] | - |
| dc.description.abstract | The Remote procedure call is a useful paradigm for transfer of control and data between distributed programs written in a high level language. The design and implementation of KAIST Remote Procedure Call (KAIST RPC) for obtaining remote services is described. For the KAIST RPC, the rendezvous approach is adopted for server programs. The KAIST RPC is different from Courier proposed by XEROX PARC in that KAIST RPC abstracts the 4.2BSD IPC facilities into a higher remote procedure call facilities. KAIST RPC makes it easy to realize client/server interactions and more general process interactions for distributed Unix system environments. | eng |
| dc.language | eng | - |
| dc.publisher | 한국과학기술원 | - |
| dc.subject | 클라이언트/서버 시스템. | - |
| dc.title | Design and implementation of a remote procedure call with rendezvous approach | - |
| dc.title.alternative | 랑데뷰 기법의 Remote procedure call 의 설계 및 구현 | - |
| dc.type | Thesis(Master) | - |
| dc.identifier.CNRN | 64581/325007 | - |
| dc.description.department | 한국과학기술원 : 전산학과, | - |
| dc.identifier.uid | 000831082 | - |
| dc.contributor.localauthor | Chon, Kil-Nam | - |
| dc.contributor.localauthor | 전길남 | - |
- Appears in Collection
- CS-Theses_Master(석사논문)
- Files in This Item
- There are no files associated with this item.
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.