Sciweavers

4797 search results - page 114 / 960
» The complexity of partition tasks
Sort
View
IPPS
1998
IEEE
14 years 2 months ago
Low Memory Cost Dynamic Scheduling of Large Coarse Grain Task Graphs
Schedulinglarge task graphsis an importantissue in parallel computingsince it allowsthe treatment of big size problems. In this paper we tackle the following problem: how to sched...
Michel Cosnard, Emmanuel Jeannot, Laurence Rougeot
ICWE
2007
Springer
14 years 4 months ago
On Embedding Task Memory in Services Composition Frameworks
With the increasing availability of Web services and adoption of services oriented paradigm, there is a growing need to dynamically compose services for realizing complex user task...
Rosanna Bova, Hye-Young Paik, Salima Hassas, Salim...
ISCAPDCS
2007
13 years 11 months ago
A rapid heuristic for scheduling non-preemptive dependent periodic tasks onto multiprocessor
We address distributed real-time applications represented by systems of non-preemptive dependent periodic tasks. This system is described by an acyclic directed graph. Because the...
Omar Kermia, Yves Sorel
WSCG
2003
171views more  WSCG 2003»
13 years 11 months ago
A Task Definition Language for Virtual Agents
The use of Virtual Environments as a user interface can be important for certain types of applications, especially in the fields of education and entertainment. These synthetic wo...
Spyros Vosinakis, Themis Panayiotopoulos
IUI
2009
ACM
14 years 7 months ago
From geek to sleek: integrating task learning tools to support end users in real-world applications
Numerous techniques exist to help users automate repetitive tasks; however, none of these methods fully support enduser creation, use, and modification of the learned tasks. We pr...
Aaron Spaulding, Jim Blythe, Will Haines, Melinda ...