An optimal approach to the task allocation problem on hierarchical architectures

20th International Parallel and Distributed Processing Symposium, IPDPS 2006

Volumn 2006, Issue , 2006, Pages

  Metzner, Alexander ^a   Fränzle, Martin ^b   Herde, Christian ^b   Stierand, Ingo ^b  

^a OFFIS INSTITUTE FOR INFORMATION TECHNOLOGY   (Germany)

^b UNIVERSITY OF OLDENBURG   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

BOOLEAN FUNCTIONS; DISTRIBUTED COMPUTER SYSTEMS; HIERARCHICAL SYSTEMS; OPTIMAL SYSTEMS; OPTIMIZATION; PROBLEM SOLVING; REAL TIME SYSTEMS; SCHEDULING;

DISTRIBUTED REAL TIME SYSTEMS; HIERARCHICAL ARCHITECTURES; NONLINEAR INTEGER OPTIMIZATION PROBLEMS; TASK ALLOCATION PROBLEM;

COMPUTER ARCHITECTURE;

EID: 33847098436     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/IPDPS.2006.1639420     Document Type: Conference Paper

References (16)

1. J. Coffman. Computer and Job-Shop Scheduling Theory. John Wiley, 1976.
2. N. Audsley, A. Burns, R. Davis, K. Tindell, and A. Wellings. Fixed priority pre-emptive scheduling: An historical perspective. Real-Time Systems, 8(2), 1995.
3. K. Tindell. Fixed Priority Scheduling of Hard Real-Time Systems. PhD thesis, University of York, 1994.
4. P. Altenbernd. Timing Analysis, Scheduling, and Allocation of Periodic Hard Real-Time Tasks. PhD thesis, Universität Paderborn, 1996.
5. K. Tindell, A. Burns, and A. Wellings. Allocating hard real time tasks (an np-hard problem made easy). In Real Time Systems Journal, volume 4(2), 1992.
6. P. Pop, P. Eles, Z. Peng, and V. Izosimov. Schedulability-driven partitioning and mapping for multi-cluster real-time systems. In Proc. of the Euromicro Conference on Real-Time Systems, 2004.
7. T. Blickle, J. Teich, and L. Thiele. System-level synthesis using evolutionary algorithms. In Proc. of the Design Automation for Embedded Systems, 1998.
8. M. Fränzle and C. Herde. Efficient SAT engines for concise logics: Accelerating proof search for zero-one linear constraint systems. In Logic for Programming, Artificial Intelligence, and Reasoning, volume 2850 of LNAI. Springer, 2003.
9. A. Bender. Design of an optimal loosely coupled heterogeneous multiprocessor system. In Proc. of the European conference on Design and Test. IEEE Computer Society, 1996.
10. D. Peng, K. Shin, and T. Abdelzaher. Assignment and scheduling communicating periodic tasks in distributed real-time systems. Software Engineering, 23(12), 1997.
11. M. Moskewicz, C. Madigan, Y. Zhao, L. Zhang, and S. Malik. Chaff: Engineering an Efficient SAT Solver. In Proc. of the Design Automation Conference, 2001.
12. L. Zhang, C. F. Madigan, M. W. Moskewicz, and S. Malik. Efficient conflict driven learning in a Boolean satisfiability solver. In Proc. of the International Conference on Computer-Aided Design, 2001.
13. E. Goldberg and Y. Novikov. Berkmin: A fast and robust sat solver. In Design Automation and Test in Europe, 2002.
14. G. Tseitin. On the complexity of derivations in propositional calculus. In Studies in Constructive Mathematics and Mathematical Logics, 1968.
15. P. Barth. A Davis-Putnam based enumeration algorithm for linear pseudo-boolean optimization. Technical Report MPI-I-95-2-003, MPI für Informatik, 1995.
16. M. Fränzle and C. Herde. Efficient proof engines for bounded model checking of hybrid systems. In International. Workshop on Formal Methods for Industrial Critical Systems, Electronic Notes in Theoretical Computer Science. Elsevier, 2004.