Rapid P2P Overlay Network Programming on a Distributed Reduction Machine

Author

Saito, Kenji ; Miyazawa, Kendai

Author_Institution

Res. Inst. for Digital Media & Content, Keio Univ., Yokohama

fYear

2009

fDate

10-13 Jan. 2009

Firstpage

1

Lastpage

5

Abstract

To build dependable and sustainable systems requires many iterative trials and stepwise improvements. Rapid programming methods and languages have been studied in the field of peer-to-peer overlay network for this reason. This paper proposes a method for quick programming using Overlay GHC[1] language, an extension of Guarded Horn Clauses[2] for overlay network programming. The method involves a technique called RGP (Remote Goal Placement) instead of RPC over an environment that is viewed as a distributed reduction machine.

Keywords

Horn clauses; formal languages; peer-to-peer computing; programming; Guarded Horn Clauses; P2P overlay network programming; RGP; distributed reduction machine; overlay GHC language; peer-to-peer overlay network; rapid programming methods; remote goal placement; Concurrent computing; Environmental economics; Iterative methods; Magnetic heads; Multicore processing; Peer to peer computing; Productivity; Programming profession; Software systems;

fLanguage

English

Publisher

ieee

Conference_Titel

Consumer Communications and Networking Conference, 2009. CCNC 2009. 6th IEEE

Conference_Location

Las Vegas, NV

Print_ISBN

978-1-4244-2308-8

Electronic_ISBN

978-1-4244-2309-5

Type

conf

DOI

10.1109/CCNC.2009.4784964

Filename

4784964