The DOI matches its Crossref record; 6 of the 6 references it cites were found in a registry or an index.
Tarcil: reconciling scheduling speed and quality in large shared clusters
Open accessAbstract
Scheduling diverse applications in large, shared clusters is particularly challenging. Recent research on cluster scheduling focuses either on scheduling speed, using sampling to quickly assign resources to tasks, or on scheduling quality, using centralized algorithms that search for the resources that improve both task performance and cluster utilization.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Large-Scale Machine Learning with Stochastic Gradient Descent
Bottou, L. (2010) · Proceedings of COMPSTAT'2010 · doi:10.1007/978-3-7908-2604-3_16 · Cited by 5,795
The PARSEC benchmark suite: characterization and architectural implications
Bienia, C., Kumar, S., Singh, J. P., & Li, K. (2008) · Proceedings of the 17th international conference on Parallel architectures and compilation techniques · doi:10.1145/1454115.1454128 · Cited by 3,444
Apache Hadoop YARN: yet another resource negotiator
Vavilapalli, V. K., Murthy, A. C., Douglas, C., Agarwal, S., Konar, M., Evans, R., Graves, T., Lowe, J., Shah, H., Seth, S., et al. (2013) · Proceedings of the 4th annual Symposium on Cloud Computing · doi:10.1145/2523616.2523633 · Cited by 1,848
(2011) · doi:10.5555/1972457.1972488 · Cited by 1,619
Near-optimal hashing algorithms for approximate nearest neighbor in high dimensions
Andoni, A., & Indyk, P. (2008) · Communications of the ACM · doi:10.1145/1327452.1327494 · Cited by 1,437 · cited 1×
“We use locality sensitive hashing (LSH) based on random selection to hash these vectors into a small set of buckets [1, 9, 30].”
MethodNear-Optimal Hashing Algorithms for Approximate Nearest Neighbor in High Dimensions
Andoni, A., & Indyk, P. (2006) · 2006 47th Annual IEEE Symposium on Foundations of Computer Science (FOCS'06) · doi:10.1109/focs.2006.49 · Cited by 1,067
Cited by
Gan, Y., Zhang, Y., Cheng, D., Shetty, A., Rathi, P., Katarki, N., Bruno, A., Hu, J., Ritchken, B., Jackson, B., et al. (2019) · Proceedings of the Twenty-Fourth International Conference on Architectural Support for Programming Languages and Operating Systems · doi:10.1145/3297858.3304013 · Cited by 665
Self-citationDynamic Cloud Task Scheduling Based on a Two-Stage Strategy
Zhang, P., & Zhou, M. (2018) · IEEE Transactions on Automation Science and Engineering · doi:10.1109/tase.2017.2693688 · Cited by 290
Who limits the resource efficiency of my datacenter: an analysis of Alibaba datacenter traces
Guo, J., Chang, Z., Wang, S., Ding, H., Feng, Y., Mao, L., & Bao, Y. (2019) · Proceedings of the International Symposium on Quality of Service · doi:10.1145/3326285.3329074 · Cited by 287
Seer: Leveraging Big Data to Navigate the Complexity of Performance Debugging in Cloud Microservices
Gan, Y., Zhang, Y., Hu, K., Cheng, D., He, Y., Pancholi, M., & Delimitrou, C. (2019) · Proceedings of the Twenty-Fourth International Conference on Architectural Support for Programming Languages and Operating Systems · doi:10.1145/3297858.3304004 · Cited by 269
Self-citationPARTIES: QoS-Aware Resource Partitioning for Multiple Interactive Services
Chen, S., Delimitrou, C., & Martínez, J. F. (2019) · Proceedings of the Twenty-Fourth International Conference on Architectural Support for Programming Languages and Operating Systems · doi:10.1145/3297858.3304005 · Cited by 267
Self-citation
Metadata
- Authors
- Delimitrou, C., Sanchez, D., & Kozyrakis, C.
- Venue
- Proceedings of the Sixth ACM Symposium on Cloud Computing
- Publisher
- ACM
- Published
- 2015-08-27
- Pages
- 97-110
- OpenAlex
- W2140094873
- Cited by
- 160
- References
- 6
- FWCI
- 12.23
- Type
- conference paper
- Language
- en
- Open access
- green
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Tarcil: reconciling scheduling speed and quality in large shared clusters. https://app.cochat.ai/papers/10.1145/2806777.2806779
- The paper
- Delimitrou, C., Sanchez, D., & Kozyrakis, C. (2015). Tarcil: reconciling scheduling speed and quality in large shared clusters. Proceedings of the Sixth ACM Symposium on Cloud Computing. https://doi.org/10.1145/2806777.2806779
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.