Tracey, K., Processor Sharing for Cooperative Multi-task Applications, Ph.D. dissertation, University of Notre Dame, Home/Search Document Details and Download
Summary Related Articles Check |
This paper is cited in the following contexts:
Distribution and Persistence: Natural Outgrowths . . . - Kulkarni, Banerji, Casey.. (1992) (Correct)
.... some containing code and others data. Tasks have names and identifiers which are globally unique and location independent. They can cooperate knowing only each other s names without regard to location. These features were included in the task structure to make migration fairly straightforward [24]. The nature of the data abstraction allows for different implementation options. The next section describes several implementations that are matched to various hardware and operating systems platforms. 4. Using the Model The ARCADE data model has been realized in several ways, and a number of ....
....with data unit links. 5.3 Language Support with Data Units Run time systems for distributed languages must provide support for remote activations. If the resulting tasks move, the run time support must find them. However, migrating an ARCADE task is transparent. In fact, a task management system [24] has been written for the micro kernel implementation which places tasks on idle machines and moves them in response to changes in local load. Thus, a user can create a distributed application which moves around an interconnection using otherwise idle workstations. Thus, run time systems are freed ....
Tracey, K., Processor Sharing for Cooperative Multi-task Applications, Ph.D. dissertation, University of Notre Dame,
ARCADE: An Architectural Basis for Distributed Systems - Banerji Casey Cohn (1992) (1 citation) Self-citation (Tracey) (Correct)
....the micro kernel implementation of ARCADE is a complete implementation of the architecture. The kernel has absolute control over the machine, so tasks correspond exactly to their definition in the ARCADE architecture [De89] Even complex task migration been handled in this implementation [Tr91]. The micro kernel has its own scheduler and dispatching mechanism. In order to suspend and dispatch tasks, it maintains information for each task s input and output lines. Whenever an output line changes, it propagates the change to all connected input lines. Whenever an input line changes, it ....
....in a location independent way. Therefore, they can be moved from machine to machine relatively easily. This has lead to the creation of a processor sharing scheme based on task migration. The scheme is designed to make optimal use of distribution while maintaining fairness between applications [Tr91]. To mechanize task migration, a new ARCADE service, migrate( was defined. This lets a task on a given machine move a remote task to the local machine if the key of the remote task is known. By only allowing local tasks to move work onto a machine, and with proper use of the privilege vector, ....
Tracey, K., Processor Sharing for Cooperative Multi-task Applications, Ph.D. dissertation, University of Notre Dame, May 1991.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC