Остановите войну!
for scientists:
default search action
Search dblp
Full-text search
- > Home
Please enter a search query
- case-insensitive prefix search: default
e.g., sig matches "SIGIR" as well as "signal" - exact word search: append dollar sign ($) to word
e.g., graph$ matches "graph", but not "graphics" - boolean and: separate words by space
e.g., codd model - boolean or: connect words by pipe symbol (|)
e.g., graph|network
Update May 7, 2017: Please note that we had to disable the phrase search operator (.) and the boolean not operator (-) due to technical problems. For the time being, phrase search queries will yield regular prefix search result, and search terms preceded by a minus will be interpreted as regular (positive) search terms.
Author search results
no matches
Venue search results
no matches
Refine list
refine by author
- no options
- temporarily not available
refine by venue
- no options
- temporarily not available
refine by type
- no options
- temporarily not available
refine by access
- no options
- temporarily not available
refine by year
- no options
- temporarily not available
Publication search results
found 62 matches
- 2024
- Raz Segal, Chen Avin, Gabriel Scalosub:
SOAR: Minimizing Network Utilization Cost With Bounded In-Network Computing. IEEE Trans. Netw. Serv. Manag. 21(2): 1832-1851 (2024) - 2023
- Yajing Lv, Ying Wang, Yongqiang Sun:
From Health Anxiety to Health Information Seeking and Utilization: Exploring the Underlying Mechanisms and Boundary Conditions. PACIS 2023: 14 - 2021
- Raz Segal, Chen Avin, Gabriel Scalosub:
SOAR: minimizing network utilization with bounded in-network computing. CoNEXT 2021: 16-29 - Raz Segal, Chen Avin, Gabriel Scalosub:
SOAR: Minimizing Network Utilization with Bounded In-network Computing. CoRR abs/2110.14224 (2021) - 2020
- Xu Jiang, Jinghao Sun, Yue Tang, Nan Guan:
Utilization-Tensity Bound for Real-Time DAG Tasks under Global EDF Scheduling. IEEE Trans. Computers 69(1): 39-50 (2020) - 2019
- Jian-Jun Han, Zhenjiang Wang, Sunlu Gong, Tianpeng Miao, Laurence T. Yang:
Resource-Aware Scheduling for Dependable Multicore Real-Time Systems: Utilization Bound and Partitioning Algorithm. IEEE Trans. Parallel Distributed Syst. 30(12): 2806-2819 (2019) - 2018
- Jian-Jun Han, Xin Tao, Dakai Zhu, Hakan Aydin, Zili Shao, Laurence T. Yang:
Multicore Mixed-Criticality Systems: Partitioned Scheduling and Utilization Bound. IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 37(1): 21-34 (2018) - 2017
- Jian-Jun Han, Xin Tao, Dakai Zhu, Laurence T. Yang:
Resource Sharing in Multicore Mixed-Criticality Systems: Utilization Bound and Blocking Overhead. IEEE Trans. Parallel Distributed Syst. 28(12): 3626-3641 (2017) - Jian-Jia Chen, Georg von der Brüggen, Wen-Hung Huang, Robert I. Davis:
On the Pitfalls of Resource Augmentation Factors and Utilization Bounds in Real-Time Scheduling. ECRTS 2017: 9:1-9:25 - Georg von der Brüggen, Niklas Ueter, Jian-Jia Chen, Matthias Freier:
Parametric utilization bounds for implicit-deadline periodic tasks in automotive systems. RTNS 2017: 108-117 - 2016
- Wen-Hung Huang, Jian-Jia Chen:
Utilization bounds on allocating rate-monotonic scheduled multi-mode tasks on multiprocessor systems. DAC 2016: 134:1-134:6 - 2015
- Enrico Bini:
The Quadratic Utilization Upper Bound for Arbitrary Deadline Real-Time Tasks. IEEE Trans. Computers 64(2): 593-599 (2015) - Pontus Ekberg, Wang Yi:
Uniprocessor Feasibility of Sporadic Tasks Remains coNP-Complete under Bounded Utilization. RTSS 2015: 87-95 - Dirk Müller, Alan Burns:
Deriving period restrictions from a given utilization bound under RMS. SIES 2015: 178-184 - 2014
- Moonju Park, Xuefeng Piao:
Enhanced utilization bound of Rate-Monotonic scheduling in Controller Area Networks. Inf. Process. Lett. 114(11): 603-606 (2014) - Jian-Jun Han, Dakai Zhu, Xiaodong Wu, Laurence T. Yang, Hai Jin:
Multiprocessor Real-Time Systems with Shared Resources: Utilization Bound and Mapping. IEEE Trans. Parallel Distributed Syst. 25(11): 2981-2991 (2014) - Hongya Wang, LihChyun Shu, Wei Yin, Yingyuan Xiao, Jiao Cao:
Hyperbolic Utilization Bounds for Rate Monotonic Scheduling on Homogeneous Multiprocessors. IEEE Trans. Parallel Distributed Syst. 25(6): 1510-1521 (2014) - Hoda Jannati, Abolfazl Falahati:
Mutual Distance Bounding Protocol with Its Implementability Over a Noisy Channel and Its Utilization for Key Agreement in Peer-to-Peer Wireless Networks. Wirel. Pers. Commun. 77(1): 127-149 (2014) - Susmit Bagchi:
Multivariate Estimation of Resource Utilization Bounds of any Variable Schedule in a Computing System. BDAS 2014: 312-322 - Guangyi Chen, Wenfang Xie:
Fixed-Priority Scheduling Policies and Their Non-utilization Bounds. ISNN 2014: 167-174 - 2012
- Nan Guan, Martin Stigge, Wang Yi, Ge Yu:
Parametric Utilization Bounds for Fixed-Priority Multiprocessor Scheduling. IPDPS 2012: 261-272 - Nan Guan, Wang Yi:
Fixed-Priority Multiprocessor Scheduling: Critical Instant, Response Time and Utilization Bound. IPDPS Workshops 2012: 2470-2473 - 2011
- Björn Andersson:
The utilization bound of static-priority preemptive partitioned multiprocessor scheduling is 50%. J. Embed. Comput. 4(2): 47-54 (2011) - Xuan Qi, Dakai Zhu, Hakan Aydin:
Cluster scheduling for real-time systems: utilization bounds and run-time overhead. Real Time Syst. 47(3): 253-284 (2011) - Yuichi Ohsita, Takashi Miyamura, Shin'ichi Arakawa, Kohei Shiomoto, Masayuki Murata:
Hierarchical Dynamic Traffic Engineering Considering the Upper Bounds of Link Utilizations. GLOBECOM 2011: 1-6 - 2010
- Nasro Min-Allah, Ishtiaq Ali, Jiansheng Xing, Yongji Wang:
Utilization bound for periodic task set with composite deadline. Comput. Electr. Eng. 36(6): 1101-1109 (2010) - Nan Guan, Martin Stigge, Wang Yi, Ge Yu:
Fixed-Priority Multiprocessor Scheduling with Liu and Layland's Utilization Bound. IEEE Real-Time and Embedded Technology and Applications Symposium 2010: 165-174 - Xuan Qi, Dakai Zhu, Hakan Aydin:
A Study of Utilization Bound and Run-Time Overhead for Cluster Scheduling in Multiprocessor Real-Time Systems. RTCSA 2010: 3-12 - 2009
- Moonju Park, Jinseok Chae:
Utilization Bound of Non-preemptive Fixed Priority Schedulers. IEICE Trans. Inf. Syst. 92-D(10): 2152-2155 (2009) - Björn Andersson, Eduardo Tovar:
The utilization bound of non-preemptive rate-monotonic scheduling in Controller Area Networks is 25%. SIES 2009: 11-18
skipping 32 more matches
loading more results
failed to load more results, please try again later
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from , , and to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
retrieved on 2024-04-27 06:46 CEST from data curated by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint