Presentation | 2012-11-02 Scheduling and Resource Assignment of Periodic Tasks in Computer Networks Using an SMT Solver Yuya SAKAI, Toshimitsu USHIO, |
---|---|
PDF Download Page | PDF download Page Link |
Abstract(in Japanese) | (See Japanese page) |
Abstract(in English) | It is important in computer networks to assign each task to a computer in order to have scheduling without deadline miss under constraints of memories. In this paper, we derive logical formulae from information of computers' memory constraints and tasks. By solving a satisfiability problem of the formulae using a Satisfiability Modulo Theories (SMT) solver, we obtain scheduling and resource assignment of tasks. |
Keyword(in Japanese) | (See Japanese page) |
Keyword(in English) | Computer network / scheduling / SAT / SMT |
Paper # | CAS2012-62,MSS2012-42 |
Date of Issue |
Conference Information | |
Committee | MSS |
---|---|
Conference Date | 2012/10/25(1days) |
Place (in Japanese) | (See Japanese page) |
Place (in English) | |
Topics (in Japanese) | (See Japanese page) |
Topics (in English) | |
Chair | |
Vice Chair | |
Secretary | |
Assistant |
Paper Information | |
Registration To | Mathematical Systems Science and its applications(MSS) |
---|---|
Language | JPN |
Title (in Japanese) | (See Japanese page) |
Sub Title (in Japanese) | (See Japanese page) |
Title (in English) | Scheduling and Resource Assignment of Periodic Tasks in Computer Networks Using an SMT Solver |
Sub Title (in English) | |
Keyword(1) | Computer network |
Keyword(2) | scheduling |
Keyword(3) | SAT |
Keyword(4) | SMT |
1st Author's Name | Yuya SAKAI |
1st Author's Affiliation | Graduate School of Engineering Science, Osaka University() |
2nd Author's Name | Toshimitsu USHIO |
2nd Author's Affiliation | Graduate School of Engineering Science, Osaka University |
Date | 2012-11-02 |
Paper # | CAS2012-62,MSS2012-42 |
Volume (vol) | vol.112 |
Number (no) | 274 |
Page | pp.pp.- |
#Pages | 4 |
Date of Issue |