Sciweavers

540 search results - page 36 / 108
» Scheduling dynamic parallelism on accelerators
Sort
View
IPPS
2010
IEEE
13 years 6 months ago
Handling errors in parallel programs based on happens before relations
Abstract--Intervals are a new model for parallel programming based on an explicit happens before relation. Intervals permit fine-grained but high-level control of the program sched...
Nicholas D. Matsakis, Thomas R. Gross
PC
2002
118views Management» more  PC 2002»
13 years 8 months ago
Parallel algorithms for indefinite linear systems
Saddle-point problems give rise to indefinite linear systems that are challenging to solve via iterative methods. This paper surveys two recent techniques for solving such problem...
Ahmed H. Sameh, Vivek Sarin
ICPP
2003
IEEE
14 years 1 months ago
Dynamic Control Frames in Reservation-Based Packet Scheduling for Single-Hop WDM Networks
In reservation-based packet scheduling algorithms for single-hop WDM networks, one of the wavelengths is used as a control channel which is shared by all of the nodes for transmit...
Hwa-Chun Lin, Pei-Shin Liu
CISIS
2010
IEEE
13 years 3 days ago
A Simple Improvement of the Work-stealing Scheduling Algorithm
Work-stealing is the todays algorithm of choice for dynamic load-balancing of irregular parallel applications on multiprocessor systems. We have evaluated the algorithm’s effic...
Zeljko Vrba, Pål Halvorsen, Carsten Griwodz
IEEEPACT
2002
IEEE
14 years 1 months ago
Software Bubbles: Using Predication to Compensate for Aliasing in Software Pipelines
This paper describes a technique for utilizing predication to support software pipelining on EPIC architectures in the presence of dynamic memory aliasing. The essential idea is t...
Benjamin Goldberg, Emily Crutcher, Chad Huneycutt,...