Sciweavers

103 search results - page 8 / 21
» Bid based scheduler with backfilling for a multiprocessor sy...
Sort
View
IPPS
1998
IEEE
13 years 11 months ago
Processor Lower Bound Formulas for Array Computations and Parametric Diophantine Systems
Using a directed acyclic graph (dag) model of algorithms, we solve a problem related to precedenceconstrained multiprocessor schedules for array computations: Given a sequence of ...
Peter R. Cappello, Ömer Egecioglu
RTCSA
2005
IEEE
14 years 1 months ago
Quasi-Static Scheduling for Multiprocessor Real-Time Systems with Hard and Soft Tasks
We address in this paper the problem of scheduling for multiprocessor real-time systems with hard and soft tasks. Utility functions are associated to soft tasks to capture their r...
Luis Alejandro Cortés, Petru Eles, Zebo Pen...
CODES
1999
IEEE
13 years 11 months ago
A hardware-software cosynthesis technique based on heterogeneous multiprocessor scheduling
In this paper, we propose a fast and simple heuristic for the cosynthesis problem targeting the system-on-chip (SOC) design. The proposed algorithm covers from implementation sele...
Hyunok Oh, Soonhoi Ha
ACMICEC
2008
ACM
270views ECommerce» more  ACMICEC 2008»
13 years 9 months ago
Adaptive strategies for predicting bidding prices in supply chain management
Supply Chain Management (SCM) involves a number of interrelated activities from negotiating with suppliers to competing for customer orders and scheduling the manufacturing proces...
Yevgeniya Kovalchuk, Maria Fasli
WDAG
1998
Springer
87views Algorithms» more  WDAG 1998»
13 years 11 months ago
Wait-Free Synchronization in Quantum-Based Multiprogrammed Systems
d Abstract) James H. Anderson, Rohit Jain, and David Ott Department of Computer Science University of North Carolina at Chapel Hill We consider wait-free synchronization in multipr...
James H. Anderson, Rohit Jain, David Ott