Zobrazeno 1 - 10
of 32
pro vyhledávání: '"ACM: C.: Computer Systems Organization/C.4: PERFORMANCE OF SYSTEMS"'
Publikováno v:
Lecture Notes in Computer Science ISBN: 9783642391996
ICWE
ICWE 2013-Web Engineering. 13th International Conference, pp. 408–415, Aalborg, Denmark, 8-12 July 2013
info:cnr-pdr/source/autori:Bertolino A.; Calabrò A.; De Angelis G./congresso_nome:ICWE 2013-Web Engineering. 13th International Conference/congresso_luogo:Aalborg, Denmark/congresso_data:8-12 July 2013/anno:2013/pagina_da:408/pagina_a:415/intervallo_pagine:408–415
Proc of the 13th International Conference Web Engineering (ICWE 2013)
Proc of the 13th International Conference Web Engineering (ICWE 2013), Jul 2013, Aalborg, Denmark. pp.408-415, ⟨10.1007/978-3-642-39200-9_34⟩
ICWE
ICWE 2013-Web Engineering. 13th International Conference, pp. 408–415, Aalborg, Denmark, 8-12 July 2013
info:cnr-pdr/source/autori:Bertolino A.; Calabrò A.; De Angelis G./congresso_nome:ICWE 2013-Web Engineering. 13th International Conference/congresso_luogo:Aalborg, Denmark/congresso_data:8-12 July 2013/anno:2013/pagina_da:408/pagina_a:415/intervallo_pagine:408–415
Proc of the 13th International Conference Web Engineering (ICWE 2013)
Proc of the 13th International Conference Web Engineering (ICWE 2013), Jul 2013, Aalborg, Denmark. pp.408-415, ⟨10.1007/978-3-642-39200-9_34⟩
International audience; Monitoring is an essential means in the management of service-oriented applications. Here, event correlation results crucial when monitoring rules aim at checking the exposed levels of Quality of Service against the Service Le
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::f8179730143df8d62755255f4ac9f84b
https://doi.org/10.1007/978-3-642-39200-9_34
https://doi.org/10.1007/978-3-642-39200-9_34
Publikováno v:
APDCM 2013
APDCM 2013, IEEE, 2013, Boston, United States
IPDPS Workshops
[Research Report] RR-8196, 2012
APDCM 2013, IEEE, 2013, Boston, United States
IPDPS Workshops
[Research Report] RR-8196, 2012
International audience; Fast checkpointing algorithms require distributed access to stable storage. This paper revisits the approach base upon double checkpointing, and compares the blocking algorithm of Zheng, Shi and Kalé, with the non-blocking al
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::95afae821e9156d41c959d3326483904
https://hal.inria.fr/hal-00925168/document
https://hal.inria.fr/hal-00925168/document
Publikováno v:
Concurrency and Computation: Practice and Experience
Concurrency and Computation: Practice and Experience, 2013, 25 (10), pp.1410-1426. ⟨10.1002/cpe.2939⟩
Concurrency and Computation: Practice and Experience, Wiley, 2013, 25 (10), pp.1410-1426. ⟨10.1002/cpe.2939⟩
Concurrency and Computation: Practice and Experience, 2013, 25 (10), pp.1410-1426. ⟨10.1002/cpe.2939⟩
Concurrency and Computation: Practice and Experience, Wiley, 2013, 25 (10), pp.1410-1426. ⟨10.1002/cpe.2939⟩
Article first published online: 15 OCT 2012; International audience; In the area of high performance computing and embedded systems, numerous code optimisation methods exist to accelerate the speed of the computation (or optimise another performance
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=dedup_wf_001::8775b470c55930451f5272d85eb76f27
https://inria.hal.science/hal-00764454
https://inria.hal.science/hal-00764454
Publikováno v:
Proceedings of the third international workshop on Large-scale system and application performance
Proceedings of the third international workshop on Large-scale system and application performance, Jun 2011, San Jose, CA, United States. pp.27--34, ⟨10.1145/1996029.1996037⟩
Proceedings of the third international workshop on Large-scale system and application performance, Jun 2011, San Jose, CA, United States. pp.27--34, ⟨10.1145/1996029.1996037⟩
International audience; Large scale distributed systems are composed of many thousands of computing units. Today's examples of such systems are grid, volunteer and cloud computing platforms. Generally, their analyses are done through monitoring tools
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::b2afc4a0c7f39567ffa8f3f172986720
https://doi.org/10.1145/1996029.1996037
https://doi.org/10.1145/1996029.1996037
Publikováno v:
Wireless Networks
Wireless Networks, Springer Verlag, 2010, 16 (3), pp.627-640. ⟨10.1007/s11276-008-0158-6⟩
Repositório Institucional da USP (Biblioteca Digital da Produção Intelectual)
Universidade de São Paulo (USP)
instacron:USP
Wireless Networks, 2010, 16 (3), pp.627-640. ⟨10.1007/s11276-008-0158-6⟩
Wireless Networks, Springer Verlag, 2010, 16 (3), pp.627-640. ⟨10.1007/s11276-008-0158-6⟩
Repositório Institucional da USP (Biblioteca Digital da Produção Intelectual)
Universidade de São Paulo (USP)
instacron:USP
Wireless Networks, 2010, 16 (3), pp.627-640. ⟨10.1007/s11276-008-0158-6⟩
International audience; The assessment of routing protocols for mobile wireless networks is a difficult task, because of the networks' dynamic behavior and the absence of benchmarks. However, some of these networks, such as intermittent wireless sens
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::f7fae985d66cb8ca8501a4dcdbb4b07b
https://hal.inria.fr/inria-00496219/file/FGM09.pdf
https://hal.inria.fr/inria-00496219/file/FGM09.pdf
Publikováno v:
[Research Report] 2009
In the age of cloud, Grid, P2P, and volunteer distributed computing, large-scale systems with tens of thousands of unreliable hosts are increasingly common. Invariably, these systems are composed of heterogeneous hosts whose individual availability o
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=dedup_wf_001::d0448bf6871426eab96f658df0e2feac
https://inria.hal.science/inria-00375624
https://inria.hal.science/inria-00375624
Publikováno v:
[Research Report] RR-7051, INRIA. 2009
In this document, we introduce Minas, a memory affinity management framework for cache-coherent NUMA Non-Uniform Memory Access) platforms, which provides either explicit memory affinity management or automatic one with efficiency and architecture abs
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=dedup_wf_001::05b84f7b5c60d270af25239c42405b2e
https://hal.inria.fr/inria-00421546
https://hal.inria.fr/inria-00421546
Publikováno v:
Revue des Sciences et Technologies de l'Information-Série TSI : Technique et Science Informatiques
Revue des Sciences et Technologies de l'Information-Série TSI : Technique et Science Informatiques, 2009, Supervision et sécurité dans les grands réseaux, 28 (4/2009), pp.479-502
Revue des Sciences et Technologies de l'Information-Série TSI : Technique et Science Informatiques, Lavoisier, 2009, Supervision et sécurité dans les grands réseaux, 28 (4/2009), pp.479-502
HAL
Revue des Sciences et Technologies de l'Information-Série TSI : Technique et Science Informatiques, 2009, Supervision et sécurité dans les grands réseaux, 28 (4/2009), pp.479-502
Revue des Sciences et Technologies de l'Information-Série TSI : Technique et Science Informatiques, Lavoisier, 2009, Supervision et sécurité dans les grands réseaux, 28 (4/2009), pp.479-502
HAL
National audience; La qualité des activités de supervision reposant sur un modèle gestionnaire-agent est un verrou à soulever notamment dans des environnements de grande taille. Les dimensions grandissantes de ces environnements altèrent consid
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=dedup_wf_001::47a1d11449910dd46a960a5030cbd2d9
https://hal.inria.fr/inria-00404847
https://hal.inria.fr/inria-00404847
Autor:
Bonnet, François, Raynal, Michel
Publikováno v:
[Research Report] PI 1932, 2009, pp.8
This paper presents a simple proof that the quorum failure detector class (denoted ) is the weakest failure detector class required to implement an atomic read/write register in an asynchronous message-passing system prone to an arbitrary number of p
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=dedup_wf_001::7988dab6c7ee97f5ea4bef7d069f5bd9
https://hal.inria.fr/inria-00392450/file/PI-1932.pdf
https://hal.inria.fr/inria-00392450/file/PI-1932.pdf
Publikováno v:
9th International Conference on Distributed Computing and Networking
9th International Conference on Distributed Computing and Networking, Jan 2008, Kolkata, India. pp.99-111
[Research Report] PI 1836, 2007, pp.13
Distributed Computing and Networking ISBN: 9783540774433
ICDCN
9th International Conference on Distributed Computing and Networking, Jan 2008, Kolkata, India. pp.99-111
[Research Report] PI 1836, 2007, pp.13
Distributed Computing and Networking ISBN: 9783540774433
ICDCN
The k-set agreement problem is a generalization of the uniform consensus problem: each process proposes a value, and each non-faulty process has to decide a value such that a decided value is a proposed value, and at most k different values are decid
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::b1a4764a0de8f0f9192016c014157ef9
https://hal.inria.fr/inria-00338093
https://hal.inria.fr/inria-00338093