Home

About

Advanced Search

Browse by Discipline

Scientific Societies

E-print Alerts

Add E-prints

E-print Network
FAQHELPSITE MAPCONTACT US


  Advanced Search  

 
Scheduling workflows by enforcing intertask dependencies y
 

Summary: Scheduling workflows by enforcing intertask
dependencies y
P C Attiez, M P Singhx, E A Emersonk, A Sheth-- and M Rusinkiewicz+
z School of Computer Science, Florida International University, Miami, Florida 33199,
USA. attie@fiu.edu
x Department of Computer Science, North Carolina State University, Raleigh, North
Carolina 276958206, USA. singh@ncsu.edu
k Department of Computer Sciences, The University of Texas at Austin, Austin, Texas
78712, USA. emerson@cs.utexas.edu
-- Large Scale Distr. Info. Sys. Lab, Department of Computer Science, University of
Georgia, Athens, Georgia, USA. amit@om.cs.uga.edu
+ Department of Computer Science, University of Houston, Houston Texas, USA.
marek@uh.edu
Abstract. Workflows are composite activities that can be used to support and
automate multisystem applications involving humans, heterogeneous databases and
legacy systems. The traditional atomic transaction model, successful for centralized
and homogeneous applications, is not suitable for supporting such workflows. Intertask
dependencies, which are conditions involving events and dependencies among workflow
tasks, are used to specify the coordination requirements among the workflow tasks and
are a central component of most workflow models. They form a basis for developing

  

Source: Attie, Paul - Department of Computer Science, American University of Beirut

 

Collections: Computer Technologies and Information Sciences