Title :
A guided tour of the Coign automatic distributed partitioning system
Author :
Hunt, Galen C. ; Scott, Michael L.
Author_Institution :
Res. Dept., Microsoft Corp., Redmond, WA, USA
Abstract :
Distributed object systems such as CORBA and DCOM bring many advances to distributed computing. The distribution process itself, however, has changed little: programmers still manually divide applications into sub-programs and assign those sub-programs to machines with little automated assistance. Often, the techniques used to choose a distribution are ad hoc. Due to high intellectual cost, applications are seldom repartitioned even in drastically changing network environments. We describe Coign, an automatic distributed partitioning system (ADPS) that significantly facilitates the development of distributed applications. Given an application (in binary form) built from distributable COM components, Coign constructs a graph model of the application´s intercomponent communication through scenario-based profiling. Later, Coign applies graph-cutting algorithms to partition the application across a network and minimize distribution costs. Using Coign, an end user without source code can transform a non-distributed application into an optimized, distributed application. Through a guided tour of Coign´s architecture and usage, we present an overview of its features. We describe the automatic distributed partitioning of three applications: Microsoft Picture It!, the Octarine word processor, and the Corporate Benefits Sample program. All are distributed automatically, sometimes with startling results. For example, Coign makes significant changes to the programmer-assigned distribution of the Corporate Benefits Sample
Keywords :
distributed object management; distributed programming; resource allocation; subroutines; CORBA; Coign; Corporate Benefits Sample program; DCOM; Microsoft Picture It!; Octarine word processor; application repartitioning; automatic distributed partitioning system; changing network environments; distributed applications development; distributed computing; distributed object systems; distribution cost minimization; distribution process; graph model; graph-cutting algorithms; intellectual cost; intercomponent communication; nondistributed application; scenario-based profiling; sub-programs; Application software; Costs; Distributed computing; Dynamic programming; ISDN; Object oriented modeling; Object oriented programming; Partitioning algorithms; Programming profession; Stress;
Conference_Titel :
Enterprise Distributed Object Computing Workshop, 1998. EDOC '98. Proceedings. Second International
Conference_Location :
La Jolla, CA
Print_ISBN :
0-7803-5158-4
DOI :
10.1109/EDOC.1998.723260