k-Selection Protocols from Energetic Complexity Perspective
| hal.structure.identifier | Institute of Mathematics and Computer Science [Wroclaw] [IMCS] | |
| dc.contributor.author | KARDAS, Marcin | |
| hal.structure.identifier | Institute of Mathematics and Computer Science [Wroclaw] [IMCS] | |
| dc.contributor.author | KLONOWSKI, Marek | |
| hal.structure.identifier | Algorithmics for computationally intensive applications over wide scale distributed platforms [CEPAGE] | |
| hal.structure.identifier | Laboratoire Bordelais de Recherche en Informatique [LaBRI] | |
| dc.contributor.author | PAJAK, Dominik | |
| hal.structure.identifier | Institute of Mathematics and Computer Science [Wroclaw] [IMCS] | |
| dc.contributor.author | WOLNY, Kamil | |
| dc.date.accessioned | 2024-04-15T09:44:19Z | |
| dc.date.available | 2024-04-15T09:44:19Z | |
| dc.date.created | 2012 | |
| dc.date.issued | 2013-05-20 | |
| dc.date.conference | 2013-05-20 | |
| dc.identifier.uri | https://oskar-bordeaux.fr/handle/20.500.12278/197833 | |
| dc.description.abstractEn | In this paper we discuss energetic complexity aspects of k-Selection protocols for the single-hop radio network (that is equivalent to Multiple Access Channel model). The aim is to grant each of k activated stations exclusive access to communication channel. We consider both deterministic as well as randomized algorithms. Our main goal is to investigate relations between minimal time of execution (time complexity) and energy consumption (energetic complexity). We present lower bound for energetic complexity for some classes of algorithms for k-Selection. We also present randomized algorithm efficient in terms of both time and energetic complexity. | |
| dc.language.iso | en | |
| dc.publisher | IEEE | |
| dc.title.en | k-Selection Protocols from Energetic Complexity Perspective | |
| dc.type | Communication dans un congrès | |
| dc.identifier.doi | 10.1109/IPDPSW.2013.80 | |
| dc.subject.hal | Informatique [cs]/Calcul parallèle, distribué et partagé [cs.DC] | |
| bordeaux.page | 726-733 | |
| bordeaux.hal.laboratories | Laboratoire Bordelais de Recherche en Informatique (LaBRI) - UMR 5800 | * |
| bordeaux.institution | Université de Bordeaux | |
| bordeaux.institution | Bordeaux INP | |
| bordeaux.institution | CNRS | |
| bordeaux.conference.title | APCDM - 16th Workshop on Advances in Parallel and Distributed Computational Models in IPDPS | |
| bordeaux.country | US | |
| bordeaux.conference.city | Boston | |
| bordeaux.peerReviewed | oui | |
| hal.identifier | hal-00769575 | |
| hal.version | 1 | |
| hal.invited | non | |
| hal.proceedings | oui | |
| hal.popular | non | |
| hal.audience | Internationale | |
| hal.origin.link | https://hal.archives-ouvertes.fr//hal-00769575v1 | |
| bordeaux.COinS | ctx_ver=Z39.88-2004&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.date=2013-05-20&rft.spage=726-733&rft.epage=726-733&rft.au=KARDAS,%20Marcin&KLONOWSKI,%20Marek&PAJAK,%20Dominik&WOLNY,%20Kamil&rft.genre=unknown |
Fichier(s) constituant ce document
| Fichiers | Taille | Format | Vue |
|---|---|---|---|
|
Il n'y a pas de fichiers associés à ce document. |
|||