uu.seUppsala universitets publikasjoner
Endre søk
Begrens søket
5678 351 - 365 of 365
RefereraExporteraLink til resultatlisten
Permanent link
Referera
Referensformat
  • apa
  • ieee
  • modern-language-association
  • vancouver
  • Annet format
Fler format
Språk
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Annet språk
Fler språk
Utmatningsformat
  • html
  • text
  • asciidoc
  • rtf
Treff pr side
  • 5
  • 10
  • 20
  • 50
  • 100
  • 250
Sortering
  • Standard (Relevans)
  • Forfatter A-Ø
  • Forfatter Ø-A
  • Tittel A-Ø
  • Tittel Ø-A
  • Type publikasjon A-Ø
  • Type publikasjon Ø-A
  • Eldste først
  • Nyeste først
  • Skapad (Eldste først)
  • Skapad (Nyeste først)
  • Senast uppdaterad (Eldste først)
  • Senast uppdaterad (Nyeste først)
  • Disputationsdatum (tidligste først)
  • Disputationsdatum (siste først)
  • Standard (Relevans)
  • Forfatter A-Ø
  • Forfatter Ø-A
  • Tittel A-Ø
  • Tittel Ø-A
  • Type publikasjon A-Ø
  • Type publikasjon Ø-A
  • Eldste først
  • Nyeste først
  • Skapad (Eldste først)
  • Skapad (Nyeste først)
  • Senast uppdaterad (Eldste først)
  • Senast uppdaterad (Nyeste først)
  • Disputationsdatum (tidligste først)
  • Disputationsdatum (siste først)
Merk
Maxantalet träffar du kan exportera från sökgränssnittet är 250. Vid större uttag använd dig av utsökningar.
  • 351.
    Zeljic, Aleksandar
    et al.
    Uppsala universitet, Teknisk-naturvetenskapliga vetenskapsområdet, Matematisk-datavetenskapliga sektionen, Institutionen för informationsteknologi, Datorteknik.
    Wintersteiger, Christoph M.
    Rümmer, Philipp
    Uppsala universitet, Teknisk-naturvetenskapliga vetenskapsområdet, Matematisk-datavetenskapliga sektionen, Institutionen för informationsteknologi, Datorteknik.
    An approximation framework for solvers and decision procedures2017Inngår i: Journal of automated reasoning, ISSN 0168-7433, E-ISSN 1573-0670, Vol. 58, nr 1, s. 127-147Artikkel i tidsskrift (Fagfellevurdert)
  • 352.
    Zeljic, Aleksandar
    et al.
    Uppsala universitet, Teknisk-naturvetenskapliga vetenskapsområdet, Matematisk-datavetenskapliga sektionen, Institutionen för informationsteknologi, Datorteknik.
    Wintersteiger, Christoph M.
    Rümmer, Philipp
    Uppsala universitet, Teknisk-naturvetenskapliga vetenskapsområdet, Matematisk-datavetenskapliga sektionen, Institutionen för informationsteknologi, Datorteknik.
    Deciding bit-vector formulas with mcSAT2016Inngår i: Theory and Applications of Satisfiability Testing: SAT 2016, Springer, 2016, s. 249-266Konferansepaper (Fagfellevurdert)
  • 353.
    Zhang, Cong
    et al.
    Simon Fraser Univ, Sch Comp Sci, Burnaby, BC V5A 1S6, Canada..
    Liu, Jiangchuan
    Simon Fraser Univ, Sch Comp Sci, Burnaby, BC V5A 1S6, Canada..
    Chen, Fei
    Jiangnan Univ, Sch Digital Media, Wuxi, Peoples R China..
    Cui, Yong
    Tsinghua Univ, Dept Comp Sci, Beijing, Peoples R China..
    Ngai, Edith C.-H.
    Uppsala universitet, Teknisk-naturvetenskapliga vetenskapsområdet, Matematisk-datavetenskapliga sektionen, Institutionen för informationsteknologi, Datorteknik.
    Dependency-Aware Caching for HTTP Adaptive Streaming2016Inngår i: 2016 Digital Media Industry And Academic Forum (DMIAF), 2016, s. 89-93Konferansepaper (Fagfellevurdert)
    Abstract [en]

    There has been significant interest in the use of HTTP adaptive streaming for live or on-demand video over the Internet in recent years. To mitigate the streaming transmission delay and reduce the networking overhead, an effective and critical approach is to utilize cache servers between the origin servers and the heterogeneous clients. As the underlying protocol for web transactions, HTTP has great potentials to explore the resources within state-of-the-art CDNs tor caching; yet distinct challenges arise in the HTTP adaptive streaming context. After examining a long-term and large-scale adaptive streaming dataset as well as statistical analysis, we demonstrate that the switching requests among the different qualities frequently emerge and constitute a significant portion in a per-day view. Consequently, they have substantially affected the performance of cache servers and Quality-of-Experience (QoE) of viewers. In this paper, we propose a novel cache model that captures the dependency among the segments in the cache server for adaptive HTTP streaming. Our work does not assume any specific selection algorithm on the client's side and hence can be easily incorporated into existing streaming cache system. Its centralized nature is also well accommodated by the latest DASH specification. The performance evaluation shows our dependency-aware strategy can significantly improved the cache hit-ratio and QoE of HTTP streaming as compared to previous methods.

  • 354. Zhang, Cong
    et al.
    Liu, Jiangchuan
    Chen, Fei
    Cui, Yong
    Ngai, Edith C.-H.
    Uppsala universitet, Teknisk-naturvetenskapliga vetenskapsområdet, Matematisk-datavetenskapliga sektionen, Institutionen för informationsteknologi, Datorteknik.
    Hu, Yuemin
    Dependency- and similarity-aware caching for HTTP adaptive streaming2018Inngår i: Multimedia tools and applications, ISSN 1380-7501, E-ISSN 1573-7721, Vol. 77, nr 1, s. 1453-1474Artikkel i tidsskrift (Fagfellevurdert)
    Abstract [en]

    There has been significant interest in the use of HTTP adaptive streaming for live or on-demand video over the Internet in recent years. To mitigate the streaming transmission delay and reduce the networking overhead, an effective and critical approach is to utilize cache services between the origin servers and the heterogeneous clients. As the underlying protocol for web transactions, HTTP has great potentials to explore the resources within state-of-the-art CDNs for caching; yet distinct challenges arise in the HTTP adaptive streaming context. After examining a long-term and large-scale adaptive streaming dataset as well as statistical analysis, we demonstrate that the switching requests among the different qualities frequently emerge and constitute a significant portion in a per-day view. Consequently, they have substantially affected the performance of cache servers and Quality-of-Experience (QoE) of viewers. In this paper, we propose a novel cache model that captures the dependency among the segments in the cache server for adaptive HTTP streaming. Our work does not assume any specific selection algorithm on the client's side and hence can be easily incorporated into existing streaming cache systems. Its centralized nature is also well accommodated by the latest DASH specification. Moreover, we extend our work to the multi-server caching context and present a similarity-aware allocation mechanism to enhance the caching efficiency. The performance evaluation shows our dependency- and similarity-aware strategy can significantly improve the cache hit-ratio and QoE of HTTP streaming as compared to previous approaches.

  • 355. Zhang, Jiao
    et al.
    Hu, Xiping
    Ning, Zhaolong
    Ngai, Edith C.-H.
    Uppsala universitet, Teknisk-naturvetenskapliga vetenskapsområdet, Matematisk-datavetenskapliga sektionen, Institutionen för informationsteknologi, Datorteknik.
    Zhou, Li
    Wei, Jibo
    Cheng, Jun
    Hu, Bin
    Energy-latency tradeoff for energy-aware offloading in mobile edge computing networks2018Inngår i: IEEE Internet of Things Journal, ISSN 2327-4662, Vol. 5, nr 4, s. 2633-2645Artikkel i tidsskrift (Fagfellevurdert)
  • 356.
    Zhang, Jiao
    et al.
    Natl Univ Def Technol, Coll Elect Sci, Changsha 410073, Hunan, Peoples R China;Chinese Acad Sci, Shenzhen Inst Adv Technol, Shenzhen 518055, Peoples R China.
    Hu, Xiping
    Chinese Acad Sci, Shenzhen Inst Adv Technol, Shenzhen 518055, Peoples R China.
    Ning, Zhaolong
    Dalian Univ Technol, Key Lab Ubiquitous Network & Serv Software Liaoni, Sch Software, Dalian 116620, Peoples R China.
    Ngai, Edith
    Uppsala universitet, Teknisk-naturvetenskapliga vetenskapsområdet, Matematisk-datavetenskapliga sektionen, Institutionen för informationsteknologi, Datorteknik. Uppsala universitet, Teknisk-naturvetenskapliga vetenskapsområdet, Matematisk-datavetenskapliga sektionen, Institutionen för informationsteknologi, Datalogi.
    Zhou, Li
    Natl Univ Def Technol, Coll Elect Sci, Changsha 410073, Hunan, Peoples R China.
    Wei, Jibo
    Natl Univ Def Technol, Coll Elect Sci, Changsha 410073, Hunan, Peoples R China.
    Cheng, Jun
    Chinese Acad Sci, Shenzhen Inst Adv Technol, Shenzhen 518055, Peoples R China.
    Hu, Bin
    Lanzhou Univ, Sch Informat Sci & Engn, Lanzhou 410073, Gansu, Peoples R China.
    Leung, Victor C. M.
    Univ British Columbia, Dept Elect & Comp Engn, Vancouver, BC V6T 1Z4, Canada.
    Joint Resource Allocation for Latency-Sensitive Services Over Mobile Edge Computing Networks With Caching2019Inngår i: IEEE Internet of Things Journal, ISSN 2327-4662, Vol. 6, nr 3, s. 4283-4294Artikkel i tidsskrift (Fagfellevurdert)
    Abstract [en]

    Mobile edge computing (MEC) has risen as a promising paradigm to provide high quality of experience via relocating the cloud server in close proximity to smart mobile devices (SMDs). In MEC networks, the MEC server with computation capability and storage resource can jointly execute the latency-sensitive offloading tasks and cache the contents requested by SMDs. In order to minimize the total latency consumption of the computation tasks, we jointly consider computation offloading, content caching, and resource allocation as an integrated model, which is formulated as a mixed integer nonlinear programming (MINLP) problem. We design an asymmetric search tree and improve the branch and bound method to obtain a set of accurate decisions and resource allocation strategies. Furthermore, we introduce the auxiliary variables to reformulate the proposed model and apply the modified generalized benders decomposition method to solve the MINLP problem in polynomial computation complexity time. Simulation results demonstrate the superiority of the proposed schemes.

  • 357.
    Zhang, Jiao
    et al.
    Natl Univ Def Technol, Coll Elect Sci, Changsha 410073, Hunan, Peoples R China.
    Zhou, Li
    Natl Univ Def Technol, Coll Elect Sci, Changsha 410073, Hunan, Peoples R China.
    Tang, Qi
    Natl Univ Def Technol, Coll Elect Sci, Changsha 410073, Hunan, Peoples R China.
    Ngai, Edith
    Uppsala universitet, Teknisk-naturvetenskapliga vetenskapsområdet, Matematisk-datavetenskapliga sektionen, Institutionen för informationsteknologi, Datorteknik.
    Hu, Xiping
    Chinese Acad Sci, Shenzhen Inst Adv Technol, Shenzhen 518055, Peoples R China.
    Zhao, Haitao
    Natl Univ Def Technol, Coll Elect Sci, Changsha 410073, Hunan, Peoples R China.
    Wei, Jibo
    Natl Univ Def Technol, Coll Elect Sci, Changsha 410073, Hunan, Peoples R China.
    Stochastic Computation Offloading and Trajectory Scheduling for UAV-Assisted Mobile Edge Computing2019Inngår i: IEEE Internet of Things Journal, ISSN 2327-4662, Vol. 6, nr 2, s. 3688-3699Artikkel i tidsskrift (Fagfellevurdert)
    Abstract [en]

    Unmanned aerial vehicle (UAV) has been witnessed as a promising approach for offering extensive coverage and additional computation capability to smart mobile devices (SMDs), especially in the scenario without available infrastructures. In this paper, a UAV-assisted mobile edge computing system with stochastic computation tasks is investigated. The system aims to minimize the average weighted energy consumption of SMDs and the UAV, subject to the constraints on computation offloading, resource allocation, and flying trajectory scheduling of the UAV. Due to nonconvexity of the problem and the time coupling of variables, a Lyapunov-based approach is applied to analyze the task queue, and the energy consumption minimization problem is decomposed into three manageable subproblems. Furthermore, a joint optimization algorithm is proposed to iteratively solve the problem. Simulation results demonstrate that the system performance obtained by the proposed scheme can outperform the benchmark schemes, and the optimal parameter selections are concluded in the experimental discussion.

  • 358. Zhang, Lei
    et al.
    Fu, Di
    Liu, Jiangchuan
    Ngai, Edith C.-H.
    Uppsala universitet, Teknisk-naturvetenskapliga vetenskapsområdet, Matematisk-datavetenskapliga sektionen, Institutionen för informationsteknologi, Datorteknik.
    Zhu, Wenwu
    On energy-efficient offloading in mobile cloud for real-time video applications2017Inngår i: IEEE transactions on circuits and systems for video technology (Print), ISSN 1051-8215, E-ISSN 1558-2205, Vol. 27, nr 1, s. 170-181Artikkel i tidsskrift (Fagfellevurdert)
  • 359.
    Zhang, Sizhuo
    et al.
    MIT CSAIL.
    Vijayaraghavan, Muralidaran
    MIT CSAIL.
    Wright, Andrew
    MIT CSAIL.
    Alipour, Mehdi
    Uppsala universitet, Teknisk-naturvetenskapliga vetenskapsområdet, Matematisk-datavetenskapliga sektionen, Institutionen för informationsteknologi, Datorteknik.
    Mithal, Arvind
    MIT CSAIL.
    Constructing a Weak Memory Model2018Konferansepaper (Fagfellevurdert)
    Abstract [en]

    Weak memory models are a consequence of the desire on part of architects to preserve all the uniprocessor optimizations while building a shared memory multiprocessor. The efforts to formalize weak memory models of ARM and POWER over the last decades are mostly empirical - they try to capture empirically observed behaviors - and end up providing no insight into the inherent nature of weak memory models. This paper takes a constructive approach to find a common base for weak memory models: we explore what a weak memory would look like if we constructed it with the explicit goal of preserving all the uniprocessor optimizations. We will disallow some optimizations which break a programmer's intuition in highly unexpected ways. The constructed model, which we call General Atomic Memory Model (GAM), allows all four load/store reorderings. We give the construction procedure of GAM, and provide insights which are used to define its operational and axiomatic semantics. Though no attempt is made to match GAM to any existing weak memory model, we show by simulation that GAM has comparable performance with other models. No deep knowledge of memory models is needed to read this paper.

  • 360. Zhang, Tianyu
    et al.
    Guan, Nan
    Deng, Qingxu
    Yi, Wang
    Uppsala universitet, Teknisk-naturvetenskapliga vetenskapsområdet, Matematisk-datavetenskapliga sektionen, Institutionen för informationsteknologi, Datorteknik.
    Start time configuration for strictly periodic real-time task systems2016Inngår i: Journal of systems architecture, ISSN 1383-7621, E-ISSN 1873-6165, Vol. 66–67, s. 61-68Artikkel i tidsskrift (Fagfellevurdert)
  • 361. Zhou, Li
    et al.
    Hu, Xiping
    Ngai, Edith C.-H.
    Uppsala universitet, Teknisk-naturvetenskapliga vetenskapsområdet, Matematisk-datavetenskapliga sektionen, Institutionen för informationsteknologi, Datorteknik.
    Zhao, Haitao
    Wang, Shan
    Wei, Jibo
    Leung, Victor C. M.
    A dynamic graph-based scheduling and interference coordination approach in heterogeneous cellular networks2016Inngår i: IEEE Transactions on Vehicular Technology, ISSN 0018-9545, E-ISSN 1939-9359, Vol. 65, nr 5, s. 3735-3748Artikkel i tidsskrift (Fagfellevurdert)
  • 362.
    Zhou, Li
    et al.
    Natl Univ Def Technol, Coll Elect Sci & Engn, Changsha, Hunan, Peoples R China..
    Hu, Xiping
    Univ British Columbia, Dept Elect & Comp Engn, Vancouver, BC, Canada..
    Zhu, Chunsheng
    Univ British Columbia, Dept Elect & Comp Engn, Vancouver, BC, Canada..
    Ngai, Edith C. -H.
    Uppsala universitet, Teknisk-naturvetenskapliga vetenskapsområdet, Matematisk-datavetenskapliga sektionen, Institutionen för informationsteknologi, Datorteknik.
    Wang, Shan
    Natl Univ Def Technol, Coll Elect Sci & Engn, Changsha, Hunan, Peoples R China..
    Wei, Jibo
    Natl Univ Def Technol, Coll Elect Sci & Engn, Changsha, Hunan, Peoples R China..
    Leung, Victor C. M.
    Univ British Columbia, Dept Elect & Comp Engn, Vancouver, BC, Canada..
    Green Small Cell Planning in Smart Cities under Dynamic Traffic Demand2015Inngår i: 2015 IEEE Conference on Computer Communications Workshops (INFOCOM WKSHPS), 2015, s. 618-623Konferansepaper (Fagfellevurdert)
    Abstract [en]

    In smart cities, cellular network plays a crucial role to support connectivity anywhere and anytime. However, the communication demand brought by applications and services is hard to predict. Traffic in cellular networks might fluctuate heavily over time to time, which causes burden and waste under different traffic states. Recently, small cell was proposed to enhance spectrum efficiency and energy efficiency in cellular networks. However, how green the small cell network can be is still a question because of the accompanying interference. To meet this challenge, new green technologies should be developed. In this paper, we propose a green small cell planning scheme considering dynamic traffic states. First, we predefine a set of candidate locations for base stations (BSs) in a geographical area and generate a connection graph which contains all possible connections between BSs and user equipments (UEs). Then we adopt a heuristic to switch off small cell BSs (s-BSs) and update BS-UE connections iteratively. Finally we obtain a cell planning solution with energy efficiency without reducing spectrum efficiency and quality-of-service (QoS) requirements. The simulation results show that our dynamic small cell planning scheme has low computational complexity and achieves a significant improvement in energy efficiency comparing with the static cell planning scheme.

  • 363.
    Zhu, Chunsheng
    et al.
    Univ British Columbia, Dept Elect & Comp Engn, Vancouver, BC V5Z 1M9, Canada..
    Leung, Victor C. M.
    Univ British Columbia, Dept Elect & Comp Engn, Vancouver, BC V5Z 1M9, Canada..
    Ngai, Edith C. -H.
    Uppsala universitet, Teknisk-naturvetenskapliga vetenskapsområdet, Matematisk-datavetenskapliga sektionen, Institutionen för informationsteknologi, Datorteknik.
    Yang, Laurence T.
    St Francis Xavier Univ, Dept Comp Sci, Antigonish, NS, Canada..
    Shu, Lei
    Guangdong Univ Petrochem Technol, Guangdong Prov Key Lab Petrochem Equipment Fault, Maoming, Peoples R China..
    Li, Xiuhua
    Univ British Columbia, Dept Elect & Comp Engn, Vancouver, BC V5Z 1M9, Canada..
    Pricing Models for Sensor-Cloud2015Inngår i: 2015 IEEE 7Th International Conference On Cloud Computing Technology And Science (Cloudcom), 2015, s. 454-457Konferansepaper (Fagfellevurdert)
    Abstract [en]

    Incorporating ubiquitous wireless sensor networks (WSNs) and powerful cloud computing (CC), Sensor-Cloud (SC) is attracting growing attention from both academia and industry. However, pricing for SC is barely explored. In this paper, filling this gap, five SC pricing models (i.e., SCPM1, SCPM2, SCPM3, SCPM4 and SCPM5) are proposed first. Particularly, they charge a SC user, based on 1) the lease period of the user; 2) the required working time of SC; 3) the SC resources utilized by the user; 4) the volume of sensory data obtained by the user; 5) the SC path that transmits sensory data from the WSN to the user, respectively. Further, analysis is also presented to study and demonstrate the performance of the proposed SCPMs. We believe that the pricing designs and analysis performed in this work could be a very valuable guidance for future researches regarding pricing in SC.

  • 364. Zhu, Chunsheng
    et al.
    Leung, Victor C. M.
    Shu, Lei
    Ngai, Edith C.-H.
    Uppsala universitet, Teknisk-naturvetenskapliga vetenskapsområdet, Matematisk-datavetenskapliga sektionen, Institutionen för informationsteknologi, Datorteknik.
    Green Internet of Things for Smart World2015Inngår i: IEEE Access, E-ISSN 2169-3536, Vol. 3, s. 2151-2162Artikkel i tidsskrift (Fagfellevurdert)
    Abstract [en]

    Smart world is envisioned as an era in which objects (e.g., watches, mobile phones, computers, cars, buses, and trains) can automatically and intelligently serve people in a collaborative manner. Paving the way for smart world, Internet of Things (IoT) connects everything in the smart world. Motivated by achieving a sustainable smart world, this paper discusses various technologies and issues regarding green IoT, which further reduces the energy consumption of IoT. Particularly, an overview regarding IoT and green IoT is performed first. Then, the hot green information and communications technologies (ICTs) (e.g., green radio frequency identification, green wireless sensor network, green cloud computing, green machine to machine, and green data center) enabling green IoT are studied, and general green ICT principles are summarized. Furthermore, the latest developments and future vision about sensor cloud, which is a novel paradigm in green IoT, are reviewed and introduced, respectively. Finally, future research directions and open problems about green IoT are presented. Our work targets to be an enlightening and latest guidance for research with respect to green IoT and smart world.

  • 365.
    Zhu, Yunyun
    Uppsala universitet, Teknisk-naturvetenskapliga vetenskapsområdet, Matematisk-datavetenskapliga sektionen, Institutionen för informationsteknologi, Datorteknik. Uppsala universitet, Teknisk-naturvetenskapliga vetenskapsområdet, Matematisk-datavetenskapliga sektionen, Institutionen för informationsteknologi, Avdelningen för datorteknik.
    Caches, Transactions and Memories: Models, Coherence and Consistency2018Doktoravhandling, med artikler (Annet vitenskapelig)
    Abstract [en]

    Computers have brought us inestimable convenience in recent years. We have become dependent on them and more sensitive to their performance. During the past decades, we have been trying to improve program efficiency. The invention of multi-core systems is regarded as the new era of boosting performance of computer programs. When we focus on improving program efficiency, we also need to pay attention to program correctness. In some specific areas, errors, aka bugs, of programs can cause disastrous consequences. The dominant approach to bug detection is testing, which is conducted by executing a program against test cases generated based on scenarios. A bug is found when the output of the program does not match the expected output defined in the test case. One main drawback of testing is that it only shows the presence of bugs. An alternative approach is formal verification, which is a method that can exhaustively analyze the program executions and therefore show the absence of bugs. This thesis focuses on one of the main areas of formal verification - model checking. Model checking analyzes a mathematical model extracted from a program and automatically checks if it satisfies the desired properties.

    In this thesis, we first consider verifying safety and liveness properties for transactional memories. In particular, we consider the FlexTM hybrid transactional memory. We build a formal model of FlexTM, and apply a small model theorem that restricts the number of threads and variables in the model. This allows us to reduce the problem of verifying safety and liveness properties of FlexTM to checking language inclusion between the automata of FlexTM and a reference transactional memory. Second, we present a method for automatic verification of cache coherence protocols in the presence of transactional memories. We build a formal model containing a filter that represents the conflict resolution strategies of the transactional memory. We also apply a small model theorem which limits the number of cache lines of the protocol. To check cache coherence, we extend a backward reachability algorithm for infinite state systems, by removing the traces not allowed by the filter. Using this technique, we verify two cache protocols under different transactional memories respectively and conclude that they both maintain coherence.  Finally, we consider verification of safety properties of programs running over Self-Invalidate and Self-Downgrade cache coherence protocols. To that end, we define a formal model which captures the weak memory model induced by such protocols. We design an algorithm for inserting a set of optimal fences in the program, which guarantees the safety property while still maintaining the efficiency of a maximal degree.

    Delarbeid
    1. Verifying safety and liveness for the FlexTM hybrid transactional memory
    Åpne denne publikasjonen i ny fane eller vindu >>Verifying safety and liveness for the FlexTM hybrid transactional memory
    Vise andre…
    2013 (engelsk)Konferansepaper, Publicerat paper (Fagfellevurdert)
    Abstract [en]

    We consider the verification of safety (strict serializability and abort consistency) and liveness obstruction and livelock freedom) for the hybrid transactional memory framework FlexTM. This framework allows for flexible implementations of transactional memories based on an adaptation of the MESI coherence protocol. FlexTM allows for both eager and lazy conflict resolution strategies. Like in the case of Software Transactional Memories, the verification problem is not trivial as the number of concurrent transactions, their size, and the number of accessed shared variables cannot be a priori bounded. This complexity is exacerbated by aspects that are specific to hardware and hybrid transactional memories. Our work takes into account intricate behaviours such as cache line based conflict detection, false sharing, invisible reads or non-transactional instructions. We carry out the first automatic verification of a hybrid transactional memory and establish, by adopting a small model approach, challenging properties such as strict serializability, abort consistency, and obstruction freedom for both an eager and a lazy conflict resolution strategies. We also detect an example that refutes livelock freedom. To achieve this, our prototype tool makes use of the latest antichain based techniques to handle systems with tens of thousands of states.

    sted, utgiver, år, opplag, sider
    Grenoble, France: , 2013
    HSV kategori
    Identifikatorer
    urn:nbn:se:uu:diva-213232 (URN)978-1-4503-2153-2 (ISBN)
    Konferanse
    Design, Automation and Test in Europe, DATE 13, Grenoble, France, March 18-22, 2013
    Prosjekter
    UPMARC
    Tilgjengelig fra: 2013-12-19 Laget: 2013-12-19 Sist oppdatert: 2018-04-09
    2. Verification of Cache Coherence Protocols wrt. Trace Filters
    Åpne denne publikasjonen i ny fane eller vindu >>Verification of Cache Coherence Protocols wrt. Trace Filters
    Vise andre…
    2015 (engelsk)Inngår i: Proc. 15th Conference on Formal Methods in Computer-Aided Design, Piscataway, NJ: IEEE , 2015, s. 9-16Konferansepaper, Publicerat paper (Fagfellevurdert)
    sted, utgiver, år, opplag, sider
    Piscataway, NJ: IEEE, 2015
    HSV kategori
    Identifikatorer
    urn:nbn:se:uu:diva-272322 (URN)978-0-9835678-5-1 (ISBN)
    Konferanse
    FMCAD 2015, September 27–30, Austin, TX
    Prosjekter
    UPMARC
    Tilgjengelig fra: 2015-09-30 Laget: 2016-01-13 Sist oppdatert: 2018-04-09
    3. Fencing programs with self-invalidation and self-downgrade
    Åpne denne publikasjonen i ny fane eller vindu >>Fencing programs with self-invalidation and self-downgrade
    Vise andre…
    2016 (engelsk)Inngår i: Formal Techniques for Distributed Objects, Components, and Systems, Springer, 2016, s. 19-35Konferansepaper, Publicerat paper (Fagfellevurdert)
    sted, utgiver, år, opplag, sider
    Springer, 2016
    Serie
    Lecture Notes in Computer Science, ISSN 0302-9743 ; 9688
    HSV kategori
    Identifikatorer
    urn:nbn:se:uu:diva-300663 (URN)10.1007/978-3-319-39570-8_2 (DOI)000379297600002 ()978-3-319-39569-2 (ISBN)
    Konferanse
    FORTE 2016, June 6–9, Heraklion, Greece
    Prosjekter
    UPMARC
    Tilgjengelig fra: 2016-05-24 Laget: 2016-08-10 Sist oppdatert: 2018-04-09bibliografisk kontrollert
    4. Mending fences with self-invalidation and self-downgrade
    Åpne denne publikasjonen i ny fane eller vindu >>Mending fences with self-invalidation and self-downgrade
    Vise andre…
    2018 (engelsk)Inngår i: Logical Methods in Computer Science, ISSN 1860-5974, E-ISSN 1860-5974, Vol. 14, nr 1, artikkel-id 6Artikkel i tidsskrift (Fagfellevurdert) Published
    HSV kategori
    Identifikatorer
    urn:nbn:se:uu:diva-347675 (URN)000426512000004 ()
    Tilgjengelig fra: 2018-01-16 Laget: 2018-04-06 Sist oppdatert: 2018-05-17bibliografisk kontrollert
5678 351 - 365 of 365
RefereraExporteraLink til resultatlisten
Permanent link
Referera
Referensformat
  • apa
  • ieee
  • modern-language-association
  • vancouver
  • Annet format
Fler format
Språk
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Annet språk
Fler språk
Utmatningsformat
  • html
  • text
  • asciidoc
  • rtf