Isomorphic Types for Open Coordination Systems

A Wilkinson; Z.Q. Zheng; Alan Malcolm Wood

Isomorphic Types for Open Coordination Systems

A Wilkinson, Z.Q. Zheng (Editor), Alan Malcolm Wood

Computer Science

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

Abstract

Open coordination systems traditionally force pro grammers to use a very limited set of types when com municating. As the system is open nothing is known at creation time about which processes will connect, how many of them there will be and what types they will use. This paper describes the ¿rst steps in an architecture to allow open systems, such as Linda, to coordi nate heterogeneous processes using general datatypes. By describing types in terms of products, sums and functions and providing functions that translate between this abstract representation and the concrete representation in the program, types can be trans ferred between programs which have no prior knowl edge of each other’s type systems. Combining this with a type isomorphism algorithm allows types that are not identical but are equivalent to be used in com munications between processes.

Original language	English
Title of host publication	Proceedings of the 17th IASTED International Conference on Parallel and Distributed Computing and Systems
Publisher	ACTA Press
Pages	404-408
Number of pages	4
Publication status	Published - 2005
Event	PDCS 2005 - Phoenix, AZ, United States Duration: 14 Nov 2005 → 16 Nov 2005

Conference

Conference	PDCS 2005
Country/Territory	United States
City	Phoenix, AZ
Period	14/11/05 → 16/11/05

Cite this

@inproceedings{e767b83f852d4bbab9d0fb9b28241eb4,

title = "Isomorphic Types for Open Coordination Systems",

abstract = "Open coordination systems traditionally force pro grammers to use a very limited set of types when com municating. As the system is open nothing is known at creation time about which processes will connect, how many of them there will be and what types they will use. This paper describes the ¿rst steps in an architecture to allow open systems, such as Linda, to coordi nate heterogeneous processes using general datatypes. By describing types in terms of products, sums and functions and providing functions that translate between this abstract representation and the concrete representation in the program, types can be trans ferred between programs which have no prior knowl edge of each other{\textquoteright}s type systems. Combining this with a type isomorphism algorithm allows types that are not identical but are equivalent to be used in com munications between processes.",

author = "A Wilkinson and Z.Q. Zheng and Wood, {Alan Malcolm}",

year = "2005",

language = "English",

pages = "404--408",

booktitle = "Proceedings of the 17th IASTED International Conference on Parallel and Distributed Computing and Systems",

publisher = "ACTA Press",

address = "Canada",

note = "PDCS 2005 ; Conference date: 14-11-2005 Through 16-11-2005",

}

TY - GEN

T1 - Isomorphic Types for Open Coordination Systems

AU - Wilkinson, A

AU - Wood, Alan Malcolm

A2 - Zheng, Z.Q.

PY - 2005

Y1 - 2005

N2 - Open coordination systems traditionally force pro grammers to use a very limited set of types when com municating. As the system is open nothing is known at creation time about which processes will connect, how many of them there will be and what types they will use. This paper describes the ¿rst steps in an architecture to allow open systems, such as Linda, to coordi nate heterogeneous processes using general datatypes. By describing types in terms of products, sums and functions and providing functions that translate between this abstract representation and the concrete representation in the program, types can be trans ferred between programs which have no prior knowl edge of each other’s type systems. Combining this with a type isomorphism algorithm allows types that are not identical but are equivalent to be used in com munications between processes.

AB - Open coordination systems traditionally force pro grammers to use a very limited set of types when com municating. As the system is open nothing is known at creation time about which processes will connect, how many of them there will be and what types they will use. This paper describes the ¿rst steps in an architecture to allow open systems, such as Linda, to coordi nate heterogeneous processes using general datatypes. By describing types in terms of products, sums and functions and providing functions that translate between this abstract representation and the concrete representation in the program, types can be trans ferred between programs which have no prior knowl edge of each other’s type systems. Combining this with a type isomorphism algorithm allows types that are not identical but are equivalent to be used in com munications between processes.

M3 - Conference contribution

SP - 404

EP - 408

BT - Proceedings of the 17th IASTED International Conference on Parallel and Distributed Computing and Systems

PB - ACTA Press

T2 - PDCS 2005

Y2 - 14 November 2005 through 16 November 2005

ER -