Остановите войну!
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 13 matches
- 1999
- Steve J. Chapin, Walfredo Cirne, Dror G. Feitelson, James Patton Jones, Scott T. Leutenegger, Uwe Schwiegelshohn, Warren Smith, David Talby:
Benchmarks and Standards for the Evaluation of Parallel Job Schedulers. JSSPP 1999: 67-90 - Steve J. Chapin, Dimitrios Katramatos, John F. Karpovich, Andrew S. Grimshaw:
The Legion Resource Management System. JSSPP 1999: 162-178 - Hubertus Franke, José E. Moreira, Pratap Pattnaik:
Process Tracking for Parallel Job Control. JSSPP 1999: 144-161 - Jörn Gehring, Thomas Preiss:
Scheduling a Metacomputer with Uncooperative Sub-schedulers. JSSPP 1999: 179-201 - Gaurav D. Ghare, Scott T. Leutenegger:
The Effect of Correlating Quantum Allocation and Job Size for Gang Scheduling. JSSPP 1999: 91-110 - James Patton Jones, Bill Nitzberg:
Scheduling for Parallel Supercomputing: A Historical Perspective of Achievable Utilization. JSSPP 1999: 1-16 - Jochen Krallmann, Uwe Schwiegelshohn, Ramin Yahyapour:
On the Design and Evaluation of Job Scheduling Algorithms. JSSPP 1999: 17-42 - Kostadis Roussos, Nawaf Bitar, Robert English:
Deterministic Batch Scheduling without Static Partitioning. JSSPP 1999: 220-235 - Warren Smith, Valerie E. Taylor, Ian T. Foster:
Using Run-Time Predictions to Estimate Queue Wait Times and Improve Scheduler Performance. JSSPP 1999: 202-219 - Kuniyasu Suzaki, David Walsh:
Scheduling on AP/Linux for Fine and Coarse Grain Parallel Processes. JSSPP 1999: 111-128 - David Talby, Dror G. Feitelson, Adi Raveh:
Comparing Logs and Models of Parallel Workloads Using the Co-plot Method. JSSPP 1999: 43-66 - Bing Bing Zhou, Richard P. Brent, Chris W. Johnson, David Walsh:
Job Re-pacing for Enhancing the Performance of Gang Scheduling. JSSPP 1999: 129-143 - Dror G. Feitelson, Larry Rudolph:
Job Scheduling Strategies for Parallel Processing, IPPS/SPDP'99 Workshop, JSSPP'99, San Juan, Puerto Rico, April 16, 1999, Proceedings. Lecture Notes in Computer Science 1659, Springer 1999, ISBN 3-540-66676-1 [contents]
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-24 08:26 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