ABSTRACT
The Carnot Project at MCC is addressing the problem of logically unifying physically-distributed, enterprise-wide, heterogeneous information. Carnot will provide a user with the means to navigate information efficiently and transparently, to update that information consistently, and to write applications easily for large, heterogeneous, distributed information systems. A prototype has been implemented which provides services for (a) enterprise modeling and model integration to create an enterprise-wide view, (b) semantic expansion of queries on the view to queries on individual resources, and (c) inter-resource consistency management. This paper describes the Carnot approach to transaction processing in environments where heterogeneous, distributed, and autonomous systems are required to coordinate the update of the local information under their control. In this approach, subtransactions are represented as a set of tasks and a set of intertask dependencies that capture the semantics of a particular relaxed transaction model. A scheduler has been implemented which schedules the execution of these tasks in the Carnot environment so that all intertask dependencies are satisfied.
- 1.Attic, P., M. Singe A. Sheth, and M. Rusinkiewicz. "Specifying and Enforcing Intertask Dependencies". submitted for publication, January, 1993.Google Scholar
- 2.Chrysanthis, P. and K. Ramamritham. "ACTA: The SAGA Continues". Chapter 10 in {4}. Google ScholarDigital Library
- 3.Elmagarmid, A., Y. Leu, W. Litwin, and M. Rusinkiewicz. "A Multidatabase Transaction Model for Interbase". Proceedings of the VLDB Conference, August, 1990. Google ScholarDigital Library
- 4.Elmagarmid, A., editor. Database Transaction Models for Advanced Appllcatlons, Morgan Kaufmann, 1992. Google ScholarDigital Library
- 5.Emerson, A. and E. Clarke. "Using Branching Time Temporal Logic to Synthesize Synchronization Skeletons". Science of Computer Programming, vol.2, 1982, 241-266.Google ScholarCross Ref
- 6.Klein, J. "Advanced Rule Driven Transaction Management." Proceedings of the IEEE COMPCON, t991.Google Scholar
- 7.Pratt, V.R. "Action Logic and Pure Induction". Logics in AI: European Workshop JELIA '90, LNCS 478, Editor: J. van Eijck, Springer-Verlag", pp. 97-120, 1990. Google ScholarDigital Library
- 8.Woelk, D., P. Cannata, M. Huhns, W, Shert, and C. Tomllnson. "Using Camot for Enterprise Information Integration". Second International Conference on Parallel and Distributed lnforma. tionSystems. January, 1993. lap. 133-136. Google ScholarDigital Library
Index Terms
- Task scheduling using intertask dependencies in Carnot
Recommendations
Task scheduling using intertask dependencies in Carnot
The Carnot Project at MCC is addressing the problem of logically unifying physically-distributed, enterprise-wide, heterogeneous information. Carnot will provide a user with the means to navigate information efficiently and transparently, to update that ...
Privileged Coordinates and Nilpotent Approximation for Carnot Manifolds, II. Carnot Coordinates
AbstractThis paper is a sequel of Choi and Ponge (J Dyn Control Syst 25:109–157, 2019) and deals with privileged coordinates and nilpotent approximation of Carnot manifolds. By a Carnot manifold, it is meant a manifold equipped with a filtration by ...
Process Scheduling in Heterogeneous Multiprocessor Systems Using Task Duplication
Scheduling tasks in heterogeneous parallel and distributed computing environments continues to be a challenging problem. In this paper, the authors investigate the Heterogeneous Earliest Finish Time HEFT algorithm, along with alternative scheduling ...
Comments