skip to main content
10.1145/170035.170150acmconferencesArticle/Chapter ViewAbstractPublication PagesmodConference Proceedingsconference-collections
Article
Free Access

Task scheduling using intertask dependencies in Carnot

Published:01 June 1993Publication History

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.

References

  1. 1.Attic, P., M. Singe A. Sheth, and M. Rusinkiewicz. "Specifying and Enforcing Intertask Dependencies". submitted for publication, January, 1993.Google ScholarGoogle Scholar
  2. 2.Chrysanthis, P. and K. Ramamritham. "ACTA: The SAGA Continues". Chapter 10 in {4}. Google ScholarGoogle ScholarDigital LibraryDigital Library
  3. 3.Elmagarmid, A., Y. Leu, W. Litwin, and M. Rusinkiewicz. "A Multidatabase Transaction Model for Interbase". Proceedings of the VLDB Conference, August, 1990. Google ScholarGoogle ScholarDigital LibraryDigital Library
  4. 4.Elmagarmid, A., editor. Database Transaction Models for Advanced Appllcatlons, Morgan Kaufmann, 1992. Google ScholarGoogle ScholarDigital LibraryDigital Library
  5. 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 ScholarGoogle ScholarCross RefCross Ref
  6. 6.Klein, J. "Advanced Rule Driven Transaction Management." Proceedings of the IEEE COMPCON, t991.Google ScholarGoogle Scholar
  7. 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 ScholarGoogle ScholarDigital LibraryDigital Library
  8. 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 ScholarGoogle ScholarDigital LibraryDigital Library

Index Terms

  1. Task scheduling using intertask dependencies in Carnot

          Recommendations

          Comments

          Login options

          Check if you have access through your login credentials or your institution to get full access on this article.

          Sign in
          • Published in

            cover image ACM Conferences
            SIGMOD '93: Proceedings of the 1993 ACM SIGMOD international conference on Management of data
            June 1993
            566 pages
            ISBN:0897915925
            DOI:10.1145/170035

            Copyright © 1993 ACM

            Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

            Publisher

            Association for Computing Machinery

            New York, NY, United States

            Publication History

            • Published: 1 June 1993

            Permissions

            Request permissions about this article.

            Request Permissions

            Check for updates

            Qualifiers

            • Article

            Acceptance Rates

            Overall Acceptance Rate785of4,003submissions,20%

          PDF Format

          View or Download as a PDF file.

          PDF

          eReader

          View online with eReader.

          eReader