Добірка наукової літератури з теми "Job parallèle"
Оформте джерело за APA, MLA, Chicago, Harvard та іншими стилями
Ознайомтеся зі списками актуальних статей, книг, дисертацій, тез та інших наукових джерел на тему "Job parallèle".
Біля кожної праці в переліку літератури доступна кнопка «Додати до бібліографії». Скористайтеся нею – і ми автоматично оформимо бібліографічне посилання на обрану працю в потрібному вам стилі цитування: APA, MLA, «Гарвард», «Чикаго», «Ванкувер» тощо.
Також ви можете завантажити повний текст наукової публікації у форматі «.pdf» та прочитати онлайн анотацію до роботи, якщо відповідні параметри наявні в метаданих.
Статті в журналах з теми "Job parallèle"
Brecht, Timothy, Xiaotie Deng, and Nian Gu. "Competitive Dynamic Multiprocessor Allocation for Parallel Applications." Parallel Processing Letters 07, no. 01 (March 1997): 89–100. http://dx.doi.org/10.1142/s0129626497000115.
Повний текст джерелаWeng, Wentao, and Weina Wang. "Achieving Zero Asymptotic Queueing Delay for Parallel Jobs." ACM SIGMETRICS Performance Evaluation Review 49, no. 1 (June 22, 2022): 25–26. http://dx.doi.org/10.1145/3543516.3456268.
Повний текст джерелаXu, Susan H. "On a job resequencing issue in parallel processor stochastic scheduling." Advances in Applied Probability 24, no. 4 (December 1992): 915–33. http://dx.doi.org/10.2307/1427719.
Повний текст джерелаXu, Susan H. "On a job resequencing issue in parallel processor stochastic scheduling." Advances in Applied Probability 24, no. 04 (December 1992): 915–33. http://dx.doi.org/10.1017/s0001867800025015.
Повний текст джерелаKumar, P. R., and J. Walrand. "Individually optimal routing in parallel systems." Journal of Applied Probability 22, no. 4 (December 1985): 989–95. http://dx.doi.org/10.2307/3213970.
Повний текст джерелаKumar, P. R., and J. Walrand. "Individually optimal routing in parallel systems." Journal of Applied Probability 22, no. 04 (December 1985): 989–95. http://dx.doi.org/10.1017/s0021900200108265.
Повний текст джерелаZheng, Feifeng, Ming Liu, Chengbin Chu, and Yinfeng Xu. "Online Parallel Machine Scheduling to Maximize the Number of Early Jobs." Mathematical Problems in Engineering 2012 (2012): 1–7. http://dx.doi.org/10.1155/2012/939717.
Повний текст джерелаShim, Sang Oh, and Seong Woo Choi. "Scheduling Jobs on Dedicated Parallel Machines." Applied Mechanics and Materials 433-435 (October 2013): 2363–66. http://dx.doi.org/10.4028/www.scientific.net/amm.433-435.2363.
Повний текст джерелаLiu, Ming, Feifeng Zheng, Zhanguo Zhu, and Chengbin Chu. "Optimal Semi-Online Algorithm for Scheduling on Two Parallel Batch Processing Machines." Asia-Pacific Journal of Operational Research 31, no. 05 (October 2014): 1450038. http://dx.doi.org/10.1142/s0217595914500389.
Повний текст джерелаLuo, Cheng Xin. "An FPTAS for Uniform Parallel-Machine Scheduling Problem with Deteriorating Jobs and Rejection." Applied Mechanics and Materials 433-435 (October 2013): 2335–38. http://dx.doi.org/10.4028/www.scientific.net/amm.433-435.2335.
Повний текст джерелаДисертації з теми "Job parallèle"
Sabin, Gerald M. "Unfairness in parallel job scheduling." Columbus, Ohio : Ohio State University, 2006. http://rave.ohiolink.edu/etdc/view?acc%5Fnum=osu1164826017.
Повний текст джерелаIslam, Mohammad Kamrul. "QoS In Parallel Job Scheduling." The Ohio State University, 2008. http://rave.ohiolink.edu/etdc/view?acc_num=osu1218566682.
Повний текст джерелаWing, A. J. "Parallel simulation of PCB job shops." Thesis, University of East Anglia, 1992. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.359342.
Повний текст джерелаLynch, Gerard. "Parallel job scheduling on heterogeneous networks of multiprocessor workstations." Thesis, National Library of Canada = Bibliothèque nationale du Canada, 1999. http://www.collectionscanada.ca/obj/s4/f2/dsk1/tape7/PQDD_0006/MQ45952.pdf.
Повний текст джерелаSong, Bin 1970. "Scheduling adaptively parallel jobs." Thesis, Massachusetts Institute of Technology, 1998. http://hdl.handle.net/1721.1/50354.
Повний текст джерелаAli, Syed Zeeshan. "An investigation into parallel job scheduling using service level agreements." Thesis, University of Manchester, 2014. https://www.research.manchester.ac.uk/portal/en/theses/an-investigation-into-parallel-job-scheduling-using-service-level-agreements(f4685321-374e-41c4-86da-d07f09ea4bac).html.
Повний текст джерелаLi, Jianqing. "A parallel approach for solving a multiple machine job sequencing problem." Thesis, National Library of Canada = Bibliothèque nationale du Canada, 2001. http://www.collectionscanada.ca/obj/s4/f2/dsk3/ftp04/MQ60235.pdf.
Повний текст джерелаZhou, Huajun. "The CON Job scheduling problem on a single and parallel machines /." Electronic version (PDF), 2003. http://dl.uncw.edu/etd/2003/zhouh/huajunzhou.pdf.
Повний текст джерелаVélez, Gallego Mario César. "Algorithms for Scheduling Parallel Batch Processing Machines with Non-Identical Job Ready Times." FIU Digital Commons, 2009. http://digitalcommons.fiu.edu/etd/276.
Повний текст джерелаGeorgiou, Yiannis. "Contributions for resource and job management in high performance computing." Grenoble, 2010. http://www.theses.fr/2010GRENM079.
Повний текст джерелаHigh Performance Computing is characterized by the latest technological evolutions in computing architectures and by the increasing needs of applications for computing power. A particular middleware called Resource and Job Management System (RJMS), is responsible for delivering computing power to applications. The RJMS plays an important role in HPC since it has a strategic place in the whole software stack because it stands between the above two layers. However, the latest evolutions in hardware and applications layers have provided new levels of complexities to this middleware. Issues like scalability, management of topological constraints, energy efficiency and fault tolerance have to be particularly considered, among others, in order to provide a better system exploitation from both the system and user point of view. This dissertation provides a state of the art upon the fundamental concepts and research issues of Resources and Jobs Management Systems. It provides a multi-level comparison (concepts, functionalities, performance) of some Resource and Jobs Management Systems in High Performance Computing. An important metric to evaluate the work of a RJMS on a platform is the observed system utilization. However, studies and logs of production platforms show that HPC systems in general suffer of significant un-utilization rates. Our study deals with these clusters' un-utilization periods by proposing methods to aggregate otherwise un-utilized resources for the benefit of the system or the application. More particularly this thesis explores RJMS level mechanisms: 1) for increasing the jobs valuable computation rates in the high volatile environments of a lightweight grid context, 2) for improving system utilization with malleability techniques and 3) providing energy efficient system management through the exploitation of idle computing machines. The experimentation and evaluation in this type of contexts provide important complexities due to the inter-dependency of multiple parameters that have to be taken into control. In this thesis we have developed a methodology based upon real-scale controlled experimentation with submission of synthetic or real workload traces
Книги з теми "Job parallèle"
Fan, Yang. Parallel job scheduling in massively parallel processors. Ottawa: National Library of Canada, 1996.
Знайти повний текст джерелаKlusáček, Dalibor, Walfredo Cirne, and Gonzalo P. Rodrigo, eds. Job Scheduling Strategies for Parallel Processing. Cham: Springer International Publishing, 2021. http://dx.doi.org/10.1007/978-3-030-88224-2.
Повний текст джерелаKlusáček, Dalibor, Walfredo Cirne, and Gonzalo P. Rodrigo, eds. Job Scheduling Strategies for Parallel Processing. Cham: Springer International Publishing, 2021. http://dx.doi.org/10.1007/978-3-030-88224-2.
Повний текст джерелаKlusáček, Dalibor, Walfredo Cirne, and Narayan Desai, eds. Job Scheduling Strategies for Parallel Processing. Cham: Springer International Publishing, 2018. http://dx.doi.org/10.1007/978-3-319-77398-8.
Повний текст джерелаFrachtenberg, Eitan, and Uwe Schwiegelshohn, eds. Job Scheduling Strategies for Parallel Processing. Berlin, Heidelberg: Springer Berlin Heidelberg, 2010. http://dx.doi.org/10.1007/978-3-642-16505-4.
Повний текст джерелаFeitelson, Dror G., and Larry Rudolph, eds. Job Scheduling Strategies for Parallel Processing. Berlin, Heidelberg: Springer Berlin Heidelberg, 1999. http://dx.doi.org/10.1007/3-540-47954-6.
Повний текст джерелаFeitelson, Dror G., and Larry Rudolph, eds. Job Scheduling Strategies for Parallel Processing. Berlin, Heidelberg: Springer Berlin Heidelberg, 1995. http://dx.doi.org/10.1007/3-540-60153-8.
Повний текст джерелаFeitelson, Dror G., and Larry Rudolph, eds. Job Scheduling Strategies for Parallel Processing. Berlin, Heidelberg: Springer Berlin Heidelberg, 2000. http://dx.doi.org/10.1007/3-540-39997-6.
Повний текст джерелаDesai, Narayan, and Walfredo Cirne, eds. Job Scheduling Strategies for Parallel Processing. Cham: Springer International Publishing, 2017. http://dx.doi.org/10.1007/978-3-319-61756-5.
Повний текст джерелаKlusáček, Dalibor, Walfredo Cirne, and Narayan Desai, eds. Job Scheduling Strategies for Parallel Processing. Cham: Springer International Publishing, 2020. http://dx.doi.org/10.1007/978-3-030-63171-0.
Повний текст джерелаЧастини книг з теми "Job parallèle"
Tripiccione, Raffaele, Michael Philippsen, Rolf Riesen, and Arthur B. Maccabe. "Job Scheduling." In Encyclopedia of Parallel Computing, 997–1002. Boston, MA: Springer US, 2011. http://dx.doi.org/10.1007/978-0-387-09766-4_212.
Повний текст джерелаDandamudi, Sivarama. "Parallel Job Scheduling." In Hierarchical Scheduling in Parallel and Cluster Systems, 49–84. Boston, MA: Springer US, 2003. http://dx.doi.org/10.1007/978-1-4615-0133-6_3.
Повний текст джерелаSanders, Peter, and Dominik Schreiber. "Decentralized Online Scheduling of Malleable NP-hard Jobs." In Euro-Par 2022: Parallel Processing, 119–35. Cham: Springer International Publishing, 2022. http://dx.doi.org/10.1007/978-3-031-12597-3_8.
Повний текст джерелаAida, Kento, Hironori Kasahara, and Seinosuke Narita. "Job scheduling scheme for pure space sharing among rigid jobs." In Job Scheduling Strategies for Parallel Processing, 98–121. Berlin, Heidelberg: Springer Berlin Heidelberg, 1998. http://dx.doi.org/10.1007/bfb0053983.
Повний текст джерелаAida, Kento. "Effect of Job Size Characteristics on Job Scheduling Performance." In Job Scheduling Strategies for Parallel Processing, 1–17. Berlin, Heidelberg: Springer Berlin Heidelberg, 2000. http://dx.doi.org/10.1007/3-540-39997-6_1.
Повний текст джерелаCirne, Walfredo, and Eitan Frachtenberg. "Web-Scale Job Scheduling." In Job Scheduling Strategies for Parallel Processing, 1–15. Berlin, Heidelberg: Springer Berlin Heidelberg, 2013. http://dx.doi.org/10.1007/978-3-642-35867-8_1.
Повний текст джерелаKlusáček, Dalibor, Mehmet Soysal, and Frédéric Suter. "Alea – Complex Job Scheduling Simulator." In Parallel Processing and Applied Mathematics, 217–29. Cham: Springer International Publishing, 2020. http://dx.doi.org/10.1007/978-3-030-43222-5_19.
Повний текст джерелаPruyne, Jim, and Miron Livny. "Managing checkpoints for parallel programs." In Job Scheduling Strategies for Parallel Processing, 140–54. Berlin, Heidelberg: Springer Berlin Heidelberg, 1996. http://dx.doi.org/10.1007/bfb0022292.
Повний текст джерелаAbawajy, J. H. "Fault-Tolerant Dynamic Job Scheduling Policy." In Distributed and Parallel Computing, 165–73. Berlin, Heidelberg: Springer Berlin Heidelberg, 2005. http://dx.doi.org/10.1007/11564621_19.
Повний текст джерелаLopez, Victor, Ana Jokanovic, Marco D’Amico, Marta Garcia, Raul Sirvent, and Julita Corbalan. "DJSB: Dynamic Job Scheduling Benchmark." In Job Scheduling Strategies for Parallel Processing, 174–88. Cham: Springer International Publishing, 2018. http://dx.doi.org/10.1007/978-3-319-77398-8_10.
Повний текст джерелаТези доповідей конференцій з теми "Job parallèle"
Toporkov, Victor, Anna Toporkova, Alexey Tselishchev, Dmitry Yemelyanov, and Petr Potekhin. "Job Flow Distribution and Ranked Jobs Scheduling in Grid Virtual Organizations." In 2015 44th International Conference on Parallel Processing Workshops (ICPPW). IEEE, 2015. http://dx.doi.org/10.1109/icppw.2015.36.
Повний текст джерелаSilva, Fabricio Alves Barbosa da, and Isaac D. Scherson. "Concurrent Gang: Towards a Flexible and Scalable Gang Scheduler." In International Symposium on Computer Architecture and High Performance Computing. Sociedade Brasileira de Computação, 1999. http://dx.doi.org/10.5753/sbac-pad.1999.19796.
Повний текст джерелаSabin, G., G. Kochhar, and P. Sadayappan. "Job fairness in non-preemptive job scheduling." In International Conference on Parallel Processing, 2004. ICPP 2004. IEEE, 2004. http://dx.doi.org/10.1109/icpp.2004.1327920.
Повний текст джерелаSouza, Augusto, and Islene Garcia. "A Preemptive Fair Scheduler Policy for Disco MapReduce Framework." In XV Workshop em Desempenho de Sistemas Computacionais e de Comunicação. Sociedade Brasileira de Computação - SBC, 2020. http://dx.doi.org/10.5753/wperformance.2016.9723.
Повний текст джерелаWeber, Daniel H., Wenchao Zhou, and Zhenghui Sha. "Job Placement for Cooperative 3D Printing." In ASME 2023 18th International Manufacturing Science and Engineering Conference. American Society of Mechanical Engineers, 2023. http://dx.doi.org/10.1115/msec2023-104613.
Повний текст джерелаZhou, Longfang, Xiaorong Zhang, Wenxiang Yang, Yongguo Han, Fang Wang, Yadong Wu, and Jie Yu. "PREP: Predicting Job Runtime with Job Running Path on Supercomputers." In ICPP 2021: 50th International Conference on Parallel Processing. New York, NY, USA: ACM, 2021. http://dx.doi.org/10.1145/3472456.3473521.
Повний текст джерелаZhou, Longfang, Xiaorong Zhang, Wenxiang Yang, Yongguo Han, Fang Wang, Yadong Wu, and Jie Yu. "PREP: Predicting Job Runtime with Job Running Path on Supercomputers." In ICPP 2021: 50th International Conference on Parallel Processing. New York, NY, USA: ACM, 2021. http://dx.doi.org/10.1145/3472456.3473521.
Повний текст джерелаJakobsche, Thomas, Nicolas Lachiche, and Florina M. Ciorba. "Investigating HPC Job Resource Requests and Job Efficiency Reporting." In 2023 22nd International Symposium on Parallel and Distributed Computing (ISPDC). IEEE, 2023. http://dx.doi.org/10.1109/ispdc59212.2023.00024.
Повний текст джерелаZhou, Wei, K. Preston White, and Hongfeng Yu. "Improving Short Job Latency Performance in Hybrid Job Schedulers with Dice." In ICPP 2019: 48th International Conference on Parallel Processing. New York, NY, USA: ACM, 2019. http://dx.doi.org/10.1145/3337821.3337851.
Повний текст джерелаKonovalov, Mikhail, and Rostislav Razumchik. "Minimizing Mean Response Time In Batch-Arrival Non-Observable Systems With Single-Server FIFO Queues Operating In Parallel." In 35th ECMS International Conference on Modelling and Simulation. ECMS, 2021. http://dx.doi.org/10.7148/2021-0272.
Повний текст джерелаЗвіти організацій з теми "Job parallèle"
Leung, Vitus Joseph, Gerald Sabin, and Ponnuswamy Sadayappan. Parallel job scheduling policies to improve fairness : a case study. Office of Scientific and Technical Information (OSTI), February 2008. http://dx.doi.org/10.2172/929521.
Повний текст джерела