Rapid P2P overlay network programming on a distributed reduction machine

Kenji Saito*, Kendai Miyazawa

*Corresponding author for this work

Research output: Chapter in Book/Report/Conference proceedingConference contribution

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.

Original languageEnglish
Title of host publication2009 6th IEEE Consumer Communications and Networking Conference, CCNC 2009
DOIs
Publication statusPublished - 2009
Externally publishedYes
Event2009 6th IEEE Consumer Communications and Networking Conference, CCNC 2009 - Las Vegas, NV, United States
Duration: 2009 Jan 102009 Jan 13

Publication series

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

Conference

Conference2009 6th IEEE Consumer Communications and Networking Conference, CCNC 2009
Country/TerritoryUnited States
CityLas Vegas, NV
Period09/1/1009/1/13

ASJC Scopus subject areas

  • Computer Networks and Communications
  • Electrical and Electronic Engineering
  • Communication

Fingerprint

Dive into the research topics of 'Rapid P2P overlay network programming on a distributed reduction machine'. Together they form a unique fingerprint.

Cite this