### Abstract

Given a multiset of positive integers A= {a_{1}, a_{2},..., a_{n}}, the pinwheel problem is to find an infinite sequence over { 1, 2,..., n} such that there is at least one symbol i within any subsequence of length a_{i}. The density of A is defined as ρ(A)= Σ_{i=1}^{n} (1/a_{i}). We limit ourselves to instances composed of three distinct integers. Currently, the best scheduler [5] can schedule such instances with a density less than 0.77. A new and fast scheduling scheme based on spectrum partitioning is proposed which improves the 0.77 result to a new 5/6 ≈ 0.83 density threshold. This scheduler has achieved the exact theoretical bound of this problem.

Original language | English |
---|---|

Title of host publication | Proceedings - 6th Euromicro Workshop on Real-Time Systems, ECRTS 1994 |

Pages | 174-179 |

Number of pages | 6 |

DOIs | |

Publication status | Published - 1994 Dec 1 |

Event | 6th Euromicro Workshop on Real-Time Systems, ECRTS 1994 - Vaesteraas, Sweden Duration: 1994 Jun 15 → 1994 Jun 17 |

### Publication series

Name | Proceedings - Euromicro Conference on Real-Time Systems |
---|---|

ISSN (Print) | 1068-3070 |

### Other

Other | 6th Euromicro Workshop on Real-Time Systems, ECRTS 1994 |
---|---|

Country | Sweden |

City | Vaesteraas |

Period | 94/6/15 → 94/6/17 |

### ASJC Scopus subject areas

- Software
- Hardware and Architecture

## Fingerprint Dive into the research topics of 'Pinwheel scheduling with three distinct numbers'. Together they form a unique fingerprint.

## Cite this

*Proceedings - 6th Euromicro Workshop on Real-Time Systems, ECRTS 1994*(pp. 174-179). [336846] (Proceedings - Euromicro Conference on Real-Time Systems). https://doi.org/10.1109/EMWRTS.1994.336846