Остановите войну!
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 12 matches
- 2020
- Andrea Marin, Sabina Rossi, Carlo Zen:
A Matlab Toolkit for the Analysis of Two-Level Processor Sharing Queues. QEST 2020: 144-147 - 2019
- Guangmin Wang, Jiancong Ge, Yunhao Yan, Ming Ling:
A Data-Sharing Aware and Scalable Cache Miss Rates Model for Multi-Core Processors with Multi-Level Cache Hierarchies. ICPADS 2019: 267-274 - Andrea Marin, Sabina Rossi, Matteo Sottana, Carlo Zen:
Theoretical and Experimental Evaluation of the Two-Level Processor Sharing Discipline for TCP Flows. MASCOTS 2019: 94-106 - 2009
- Konstantin Avrachenkov, Patrick Brown, Natalia Osipova:
Optimal choice of threshold in Two Level Processor Sharing. Ann. Oper. Res. 170(1): 21-39 (2009) - Vladimir Cakarevic, Petar Radojkovic, Javier Verdú, Alex Pajuelo, Francisco J. Cazorla, Mario Nemirovsky, Mateo Valero:
Characterizing the resource-sharing levels in the UltraSPARC T2 processor. MICRO 2009: 481-492 - 2008
- Juha Leino:
Flow-level performance analysis of data networks using processor sharing models. Helsinki University of Technology, Finland, 2008 - 2007
- Konstantin Avrachenkov, Patrick Brown, Natalia Osipova:
Optimal Choice of Threshold in Two Level Processor Sharing. CoRR abs/0706.1563 (2007) - 2006
- Samuli Aalto, Urtzi Ayesta:
Mean Delay Analysis of Multi Level Processor Sharing Disciplines. INFOCOM 2006 - 2005
- Konstantin Avrachenkov, Urtzi Ayesta, Patrick Brown:
Batch Arrival Processor-Sharing with Application to Multi-Level Processor-Sharing Scheduling. Queueing Syst. Theory Appl. 50(4): 459-480 (2005) - 2004
- Romain Dolbeau, André Seznec:
CASH: Revisiting Hardware Sharing in Single-Chip Parallel Processors. J. Instr. Level Parallelism 6 (2004) - Samuli Aalto, Urtzi Ayesta, Eeva Nyberg-Oksanen:
Two-level processor-sharing scheduling disciplines: mean delay analysis. SIGMETRICS 2004: 97-105 - 2003
- Felician Németh, Peter Barta, József Bíró:
Network Level Call Admission Control Algorithms for Generalized Processor Sharing Scheduling Discipline. ISCC 2003: 1299-1305
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-25 02:57 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