Search for Topics All Reviews
	Browse All Reviews > Software (D) > Operating Systems (D.4) > Process Management (D.4.1) > Scheduling (D.4.1...)     Options: All Media Types Journals Proceedings Div Books Whole Books Other Date Reviewed Title Author Publisher Published Date Descending Ascending     1-10 of 45 Reviews about "Scheduling (D.4.1...)": Date Reviewed   Efficient instruction scheduling using real-time load delay tracking Diavastos A., Carlson T. ACM Transactions on Computer Systems 40(1-4): 1-21, 2022.  Type: Article Central processing unit (CPU) architectures with out-of-order instruction scheduling use, among other data, static instruction-timing information to create good schedules. The work reported in this paper describes the result of augmenting out-of-o... Oct 27 2023   Package-aware scheduling of FaaS functions Abad C., Boza E., van Eyk E.  ICPE 2018 (Companion of the 2018 ACM/SPEC International Conference on Performance Engineering, Berlin, Germany, Apr 9-13, 2018) 101-106, 2018.  Type: Proceedings This paper applies the longstanding notion of caching to the new field of serverless computing. Moving computation to the data, that is, functions to the nodes where libraries are cached, is advantageous to function-as-a-service (FaaS)... Mar 22 2019   Scheduling distributed clusters of parallel machines: primal-dual and LP-based approximation algorithms Murray R., Khuller S., Chao M. Algorithmica 80(10): 2777-2798, 2018.  Type: Article As large amounts of data continue to accumulate at never-before-seen rates, it becomes uneconomical to store it at a single location, not to mention storing copies at different locations. One solution is to partition the data and store... Aug 17 2018   A constraint programming scheduler for heterogeneous high-performance computing machines Bridi T., Bartolini A., Lombardi M., Milano M., Benini L. IEEE Transactions on Parallel and Distributed Systems 27(10): 2781-2794, 2016.  Type: Article If you have managed high-performance computing (HPC) facilities, you will be aware of the difficulties that can arise in job scheduling. Nineteen nodes in your large-memory queue become available; you have one user who wants 20 nodes f... Mar 23 2017    Survey of scheduling techniques for addressing shared resources in multicore processors Zhuravlev S., Saez J., Blagodurov S., Fedorova A., Prieto M. ACM Computing Surveys 45(1): 1-28, 2012.  Type: Article The new scheduling challenges posed by chip multicore architectures have opened new research directions in operating system scheduling. This survey paper provides an excellent introduction to this fascinating topic for the reader who h... Apr 4 2013   A delay optimal scheduling policy for real time services in WCDMA systems Komnakos D., Skoutas D., Vouyioukas D., Rouskas A. Wireless Personal Communications: An International Journal 61(2): 435-445, 2011.  Type: Article High speed packet access (HSPA) is a new technology based on the popular wideband code division multiple access (WCDMA). HSPA is even better than the earlier WCDMA-UMTS (universal mobile telecommunications system). It provides higher d... Jul 23 2012   Worst case analysis of decomposed software pipelining for cyclic unitary RCPSP with precedence delays Benabid A., Hanen C. Journal of Scheduling 14(5): 511-522, 2011.  Type: Article Scheduling algorithms are infiltrating all aspects of life, as I recently found out when trying to order a dishwasher to be delivered on a particular date. (The retailer’s vehicle scheduling and route planning algorithm said ... May 14 2012   Scheduling large jobs by abstraction refinement Henzinger T., Singh V., Wies T., Zufferey D.  EuroSys 2011 (Proceedings of the 6th Conference on Computer Systems, Salzburg, Austria, Apr 10-13, 2011) 329-342, 2011.  Type: Proceedings The core idea of this paper is to use abstraction and refinement to solve large-scale job scheduling problems. Given a large scheduling problem with constraints on the required solution, the idea is to first abstract a problem that one... Jul 27 2011   Reduction-based schedulability analysis of distributed systems with cycles in the task graph Jayachandran P., Abdelzaher T. Real-Time Systems 46(1): 121-151, 2010.  Type: Article Acyclic tasks have been analyzed to death. When cycles are added to any task graph, practically all forms of analysis fall apart. Hence, most research tends to focus on forming upper bounds on some metric, whether it’s schedu... Mar 4 2011   Dynamic load balancing for I/O-intensive applications on clusters Qin X., Jiang H., Manzanares A., Ruan X., Yin S. ACM Transactions on Storage 5(3): 1-38, 2009.  Type: Article The domain of optimizing process execution for high-performance computing (HPC) applications is explored in this paper. These applications execute many smaller processes in parallel on large computing clusters. The challenge in this pa... Feb 18 2010       Display 510152550100 per page
	Reproduction in whole or in part without permission is prohibited.   Copyright 1999-2024 ThinkLoud® Terms of Use | Privacy Policy