The Infona portal uses cookies, i.e. strings of text saved by a browser on the user's device. The portal can access those files and use them to remember the user's data, such as their chosen settings (screen view, interface language, etc.), or their login data. By using the Infona portal the user accepts automatic saving and using this information for portal operation purposes. More information on the subject can be found in the Privacy Policy and Terms of Service. By closing this window the user confirms that they have read the information on cookie usage, and they accept the privacy policy and the way cookies are used by the portal. You can change the cookie settings in your browser.
Graph scheduling has been shown effective for solving irregular problems represented as directed acyclic graphs(DAGs) on distributed memory systems. Many scientific applications can also be modeled as iterative task graphs(ITGs). In this paper, we model the SOR computation for solving sparse matrix systems in terms of ITGs and address the optimization issues for scheduling ITGs when communication...
In this paper, we consider the problem of scheduling a database query execution graph on a parallel machine. Specifically, we consider the problem of data-partitioning pipelined operators with the objective of minimizing response time. This is a basic problem in scheduling database execution trees. Partitioning promises increased parallelism and memory availability at the price of greater communication...
We discuss the static scheduling and code generation problem for message passing architectures. Using ideas from successful manually written programs for message passing architectures we have developed several new automatic algorithms for scheduling and code generation. These algorithms have been implemented in a preliminary software system named PYRROS. The purpose of this paper is to provide a justification...
A new approach to parallelizing harmonic balance simulation is presented. The technique leverages circuit substructure to expose potential parallelism in the form of a directed, acyclic graph (dag) of computations. This dag is then allocated and scheduled using various linear clustering techniques. The result is a highly scalable and efficient approach to harmonic balance simulation. Two large examples,...
Set the date range to filter the displayed results. You can set a starting date, ending date or both. You can enter the dates manually or choose them from the calendar.