Designing Network Servers within a Hierarchical Scheduling Framework

• Tipo: Artigo em Livro de Atas de Conferência Internacional
• Data: 2015

Autores

Iqbal, Z (Autor) Outra; Luis Almeida (Autor) FEUP; Behnam, M (Autor) Outra

Ata de Conferência Internacional

Título: Proceedings of the 30th Annual ACM Symposium on Applied Computing, Salamanca, Spain, April 13-17, 2015

Páginas: 653-658

Indexação

ISI Web of Knowledge - 1 Citação

Scopus - 3 Citações

Outras Informações

ID Authenticus: P-00K-44K

DOI: 10.1145/2695664.2695919

Abstract (EN): As distributed applications are becoming more complex, compositionality achieves a stronger importance. Such property allows composing complex applications, integrating independently developed components while maintaining their properties upon integration. The Hierarchical Scheduling Framework (HSF) appears as a design approach to meet such aim. In general, existing works regarding server design consider a two-level hierarchy applied to the CPU with a fully preemptive task scheduler. Thus these are not directly applicable to the network case with non-preemptive packet scheduling in a multi-level hierarchy. Server design problem relates to choosing server interfaces (i.e. budget and period), given a particular internal workload such that it is schedulable independently of other components in the system. In this work, we focus on the design of polling servers in the hierarchies, applied in a network context. We provide a novel method to generate server interfaces and we validate it with extensive simulations using random message sets and hierarchies. The generated interfaces are tight to 1% of their capacities and when compared with a simple approach of generating interfaces with similar parameters as the messages they serve, our framework requires 3 times less bandwidth at the root server level using 25% more of the deadline interval, on average.

Idioma: Inglês

Tipo (Avaliação Docente): Científica

Nº de páginas: 6