Zobrazeno 1 - 10
of 75
pro vyhledávání: '"Modeling of computer architecture"'
Publikováno v:
IEEE Communications Letters. 25:1500-1504
Service deployment at the network edge is a promising area that has been studied recently in the literature. In this work we have investigated a Fog-as-a-Service scenario, where multiple Server Fog Nodes (SFNs) can serve multiple Client Fog Nodes (CF
Publikováno v:
EVER
This paper proposes a SiC-based off-board charging system for battery electric buses (BEBs) and its control design for tracking the DC link voltage. The virtual sensing architecture design based on Adaptive Kalman Filter (AKF) is developed to accurat
Publikováno v:
IEEE Transactions on Computers, 67(6), 755-770. IEEE Computer Society
Simulators help computer architects optimize system designs. The limited performance of simulators even of moderate size and detail makes the approach infeasible for design-space exploration of future exascale systems. Analytic models, in contrast, o
Autor:
Carles Hernandez, Guillem Bernat, Francisco J. Cazorla, Tullio Vardanega, Jaume Abella, Enrico Mezzetti
Publikováno v:
UPCommons. Portal del coneixement obert de la UPC
Universitat Politècnica de Catalunya (UPC)
Recercat. Dipósit de la Recerca de Catalunya
instname
Universitat Politècnica de Catalunya (UPC)
Recercat. Dipósit de la Recerca de Catalunya
instname
MBTA studies the system’s timing in analysis scenarios, to determine upper bounds to the worst-case execution-time behavior that may occur at operation. MBTA’s challenge is to construct analysis-time scenarios that help compute WCET estimates tha
Autor:
Daniel Pierre, Bonhaure Falcón
Publikováno v:
SEDICI (UNLP)
Universidad Nacional de La Plata
instacron:UNLP
Universidad Nacional de La Plata
instacron:UNLP
En este trabajo presentamos cómo la adopción del ASM apoya la portabilidad del PIM y mantiene el modelo arquitectónico independiente de la plataforma de implementación. Para el efecto, adoptamos MoWebA, con sus reglas de transformación M2M que p
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::b92c741c2c70fb5f864328466fa46b40
https://doi.org/10.35537/10915/63661
https://doi.org/10.35537/10915/63661
Autor:
Susmit Sarkar, Peter Sewell, Mark Batty, Christopher Pulte, Kyndylan Nienhuis, Ali Sezgin, Luc Maranget, Shaked Flur, Kathryn E. Gray
Publikováno v:
44th ACM SIGPLAN Symposium on Principles of Programming Languages (POPL 2017)
44th ACM SIGPLAN Symposium on Principles of Programming Languages (POPL 2017), ACM, Jan 2017, Paris, France
POPL
44th ACM SIGPLAN Symposium on Principles of Programming Languages (POPL 2017), ACM, Jan 2017, Paris, France
POPL
This work was partly funded by the EPSRC Programme Grant REMS: Rigorous Engineering for Mainstream Systems, EP/K008528/1, EPSRC grant C3: Scalable & Verified Shared Memory via Consistency-directed Cache Coherence EP/M027317/1 (Sarkar), an ARM iCASE a
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::28e5ffb005cc51cf5dd097d1971c6ded
https://kar.kent.ac.uk/64723/1/mixed-size.pdf
https://kar.kent.ac.uk/64723/1/mixed-size.pdf
Publikováno v:
12th IEEE International Conference on High Performance Computing and Communications, pp. 239–246, Melbourne, Australia, 1-3 September 2010
info:cnr-pdr/source/autori:Capannini G.; Silvestri F.; Baraglia R./congresso_nome:12th IEEE International Conference on High Performance Computing and Communications/congresso_luogo:Melbourne, Australia/congresso_data:1-3 September 2010/anno:2010/pagina_da:239/pagina_a:246/intervallo_pagine:239–246
ISTI Technical reports, 2010
HPCC
info:cnr-pdr/source/autori:Capannini G.; Silvestri F.; Baraglia R./congresso_nome:12th IEEE International Conference on High Performance Computing and Communications/congresso_luogo:Melbourne, Australia/congresso_data:1-3 September 2010/anno:2010/pagina_da:239/pagina_a:246/intervallo_pagine:239–246
ISTI Technical reports, 2010
HPCC
We introduce K-model, a computational model to evaluate the algorithms designed for graphic processors, and other architectures adhering to the stream programming model. We address the lack of a formal complexity model that properly accounts for memo
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::ffada43c1d64efcdd83ea548ffc002f6
http://www.cnr.it/prodotto/i/92051
http://www.cnr.it/prodotto/i/92051
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.