Gotowa bibliografia na temat „Job parallèle”
Utwórz poprawne odniesienie w stylach APA, MLA, Chicago, Harvard i wielu innych
Spis treści
Zobacz listy aktualnych artykułów, książek, rozpraw, streszczeń i innych źródeł naukowych na temat „Job parallèle”.
Przycisk „Dodaj do bibliografii” jest dostępny obok każdej pracy w bibliografii. Użyj go – a my automatycznie utworzymy odniesienie bibliograficzne do wybranej pracy w stylu cytowania, którego potrzebujesz: APA, MLA, Harvard, Chicago, Vancouver itp.
Możesz również pobrać pełny tekst publikacji naukowej w formacie „.pdf” i przeczytać adnotację do pracy online, jeśli odpowiednie parametry są dostępne w metadanych.
Artykuły w czasopismach na temat "Job parallèle"
Brecht, Timothy, Xiaotie Deng i Nian Gu. "Competitive Dynamic Multiprocessor Allocation for Parallel Applications". Parallel Processing Letters 07, nr 01 (marzec 1997): 89–100. http://dx.doi.org/10.1142/s0129626497000115.
Pełny tekst źródłaWeng, Wentao, i Weina Wang. "Achieving Zero Asymptotic Queueing Delay for Parallel Jobs". ACM SIGMETRICS Performance Evaluation Review 49, nr 1 (22.06.2022): 25–26. http://dx.doi.org/10.1145/3543516.3456268.
Pełny tekst źródłaXu, Susan H. "On a job resequencing issue in parallel processor stochastic scheduling". Advances in Applied Probability 24, nr 4 (grudzień 1992): 915–33. http://dx.doi.org/10.2307/1427719.
Pełny tekst źródłaXu, Susan H. "On a job resequencing issue in parallel processor stochastic scheduling". Advances in Applied Probability 24, nr 04 (grudzień 1992): 915–33. http://dx.doi.org/10.1017/s0001867800025015.
Pełny tekst źródłaKumar, P. R., i J. Walrand. "Individually optimal routing in parallel systems". Journal of Applied Probability 22, nr 4 (grudzień 1985): 989–95. http://dx.doi.org/10.2307/3213970.
Pełny tekst źródłaKumar, P. R., i J. Walrand. "Individually optimal routing in parallel systems". Journal of Applied Probability 22, nr 04 (grudzień 1985): 989–95. http://dx.doi.org/10.1017/s0021900200108265.
Pełny tekst źródłaZheng, Feifeng, Ming Liu, Chengbin Chu i 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.
Pełny tekst źródłaShim, Sang Oh, i Seong Woo Choi. "Scheduling Jobs on Dedicated Parallel Machines". Applied Mechanics and Materials 433-435 (październik 2013): 2363–66. http://dx.doi.org/10.4028/www.scientific.net/amm.433-435.2363.
Pełny tekst źródłaLiu, Ming, Feifeng Zheng, Zhanguo Zhu i Chengbin Chu. "Optimal Semi-Online Algorithm for Scheduling on Two Parallel Batch Processing Machines". Asia-Pacific Journal of Operational Research 31, nr 05 (październik 2014): 1450038. http://dx.doi.org/10.1142/s0217595914500389.
Pełny tekst źródłaLuo, Cheng Xin. "An FPTAS for Uniform Parallel-Machine Scheduling Problem with Deteriorating Jobs and Rejection". Applied Mechanics and Materials 433-435 (październik 2013): 2335–38. http://dx.doi.org/10.4028/www.scientific.net/amm.433-435.2335.
Pełny tekst źródłaRozprawy doktorskie na temat "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.
Pełny tekst źródłaIslam, Mohammad Kamrul. "QoS In Parallel Job Scheduling". The Ohio State University, 2008. http://rave.ohiolink.edu/etdc/view?acc_num=osu1218566682.
Pełny tekst źródłaWing, 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.
Pełny tekst źródłaLynch, 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.
Pełny tekst źródłaSong, Bin 1970. "Scheduling adaptively parallel jobs". Thesis, Massachusetts Institute of Technology, 1998. http://hdl.handle.net/1721.1/50354.
Pełny tekst źródłaAli, 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.
Pełny tekst źródłaLi, 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.
Pełny tekst źródłaZhou, 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.
Pełny tekst źródłaVé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.
Pełny tekst źródłaGeorgiou, Yiannis. "Contributions for resource and job management in high performance computing". Grenoble, 2010. http://www.theses.fr/2010GRENM079.
Pełny tekst źródłaHigh 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
Książki na temat "Job parallèle"
Fan, Yang. Parallel job scheduling in massively parallel processors. Ottawa: National Library of Canada, 1996.
Znajdź pełny tekst źródłaKlusáček, Dalibor, Walfredo Cirne i Gonzalo P. Rodrigo, red. Job Scheduling Strategies for Parallel Processing. Cham: Springer International Publishing, 2021. http://dx.doi.org/10.1007/978-3-030-88224-2.
Pełny tekst źródłaKlusáček, Dalibor, Walfredo Cirne i Gonzalo P. Rodrigo, red. Job Scheduling Strategies for Parallel Processing. Cham: Springer International Publishing, 2021. http://dx.doi.org/10.1007/978-3-030-88224-2.
Pełny tekst źródłaKlusáček, Dalibor, Walfredo Cirne i Narayan Desai, red. Job Scheduling Strategies for Parallel Processing. Cham: Springer International Publishing, 2018. http://dx.doi.org/10.1007/978-3-319-77398-8.
Pełny tekst źródłaFrachtenberg, Eitan, i Uwe Schwiegelshohn, red. Job Scheduling Strategies for Parallel Processing. Berlin, Heidelberg: Springer Berlin Heidelberg, 2010. http://dx.doi.org/10.1007/978-3-642-16505-4.
Pełny tekst źródłaFeitelson, Dror G., i Larry Rudolph, red. Job Scheduling Strategies for Parallel Processing. Berlin, Heidelberg: Springer Berlin Heidelberg, 1999. http://dx.doi.org/10.1007/3-540-47954-6.
Pełny tekst źródłaFeitelson, Dror G., i Larry Rudolph, red. Job Scheduling Strategies for Parallel Processing. Berlin, Heidelberg: Springer Berlin Heidelberg, 1995. http://dx.doi.org/10.1007/3-540-60153-8.
Pełny tekst źródłaFeitelson, Dror G., i Larry Rudolph, red. Job Scheduling Strategies for Parallel Processing. Berlin, Heidelberg: Springer Berlin Heidelberg, 2000. http://dx.doi.org/10.1007/3-540-39997-6.
Pełny tekst źródłaDesai, Narayan, i Walfredo Cirne, red. Job Scheduling Strategies for Parallel Processing. Cham: Springer International Publishing, 2017. http://dx.doi.org/10.1007/978-3-319-61756-5.
Pełny tekst źródłaKlusáček, Dalibor, Walfredo Cirne i Narayan Desai, red. Job Scheduling Strategies for Parallel Processing. Cham: Springer International Publishing, 2020. http://dx.doi.org/10.1007/978-3-030-63171-0.
Pełny tekst źródłaCzęści książek na temat "Job parallèle"
Tripiccione, Raffaele, Michael Philippsen, Rolf Riesen i Arthur B. Maccabe. "Job Scheduling". W Encyclopedia of Parallel Computing, 997–1002. Boston, MA: Springer US, 2011. http://dx.doi.org/10.1007/978-0-387-09766-4_212.
Pełny tekst źródłaDandamudi, Sivarama. "Parallel Job Scheduling". W 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.
Pełny tekst źródłaSanders, Peter, i Dominik Schreiber. "Decentralized Online Scheduling of Malleable NP-hard Jobs". W Euro-Par 2022: Parallel Processing, 119–35. Cham: Springer International Publishing, 2022. http://dx.doi.org/10.1007/978-3-031-12597-3_8.
Pełny tekst źródłaAida, Kento, Hironori Kasahara i Seinosuke Narita. "Job scheduling scheme for pure space sharing among rigid jobs". W Job Scheduling Strategies for Parallel Processing, 98–121. Berlin, Heidelberg: Springer Berlin Heidelberg, 1998. http://dx.doi.org/10.1007/bfb0053983.
Pełny tekst źródłaAida, Kento. "Effect of Job Size Characteristics on Job Scheduling Performance". W 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.
Pełny tekst źródłaCirne, Walfredo, i Eitan Frachtenberg. "Web-Scale Job Scheduling". W 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.
Pełny tekst źródłaKlusáček, Dalibor, Mehmet Soysal i Frédéric Suter. "Alea – Complex Job Scheduling Simulator". W Parallel Processing and Applied Mathematics, 217–29. Cham: Springer International Publishing, 2020. http://dx.doi.org/10.1007/978-3-030-43222-5_19.
Pełny tekst źródłaPruyne, Jim, i Miron Livny. "Managing checkpoints for parallel programs". W Job Scheduling Strategies for Parallel Processing, 140–54. Berlin, Heidelberg: Springer Berlin Heidelberg, 1996. http://dx.doi.org/10.1007/bfb0022292.
Pełny tekst źródłaAbawajy, J. H. "Fault-Tolerant Dynamic Job Scheduling Policy". W Distributed and Parallel Computing, 165–73. Berlin, Heidelberg: Springer Berlin Heidelberg, 2005. http://dx.doi.org/10.1007/11564621_19.
Pełny tekst źródłaLopez, Victor, Ana Jokanovic, Marco D’Amico, Marta Garcia, Raul Sirvent i Julita Corbalan. "DJSB: Dynamic Job Scheduling Benchmark". W 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.
Pełny tekst źródłaStreszczenia konferencji na temat "Job parallèle"
Toporkov, Victor, Anna Toporkova, Alexey Tselishchev, Dmitry Yemelyanov i Petr Potekhin. "Job Flow Distribution and Ranked Jobs Scheduling in Grid Virtual Organizations". W 2015 44th International Conference on Parallel Processing Workshops (ICPPW). IEEE, 2015. http://dx.doi.org/10.1109/icppw.2015.36.
Pełny tekst źródłaSilva, Fabricio Alves Barbosa da, i Isaac D. Scherson. "Concurrent Gang: Towards a Flexible and Scalable Gang Scheduler". W 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.
Pełny tekst źródłaSabin, G., G. Kochhar i P. Sadayappan. "Job fairness in non-preemptive job scheduling". W International Conference on Parallel Processing, 2004. ICPP 2004. IEEE, 2004. http://dx.doi.org/10.1109/icpp.2004.1327920.
Pełny tekst źródłaSouza, Augusto, i Islene Garcia. "A Preemptive Fair Scheduler Policy for Disco MapReduce Framework". W 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.
Pełny tekst źródłaWeber, Daniel H., Wenchao Zhou i Zhenghui Sha. "Job Placement for Cooperative 3D Printing". W ASME 2023 18th International Manufacturing Science and Engineering Conference. American Society of Mechanical Engineers, 2023. http://dx.doi.org/10.1115/msec2023-104613.
Pełny tekst źródłaZhou, Longfang, Xiaorong Zhang, Wenxiang Yang, Yongguo Han, Fang Wang, Yadong Wu i Jie Yu. "PREP: Predicting Job Runtime with Job Running Path on Supercomputers". W ICPP 2021: 50th International Conference on Parallel Processing. New York, NY, USA: ACM, 2021. http://dx.doi.org/10.1145/3472456.3473521.
Pełny tekst źródłaZhou, Longfang, Xiaorong Zhang, Wenxiang Yang, Yongguo Han, Fang Wang, Yadong Wu i Jie Yu. "PREP: Predicting Job Runtime with Job Running Path on Supercomputers". W ICPP 2021: 50th International Conference on Parallel Processing. New York, NY, USA: ACM, 2021. http://dx.doi.org/10.1145/3472456.3473521.
Pełny tekst źródłaJakobsche, Thomas, Nicolas Lachiche i Florina M. Ciorba. "Investigating HPC Job Resource Requests and Job Efficiency Reporting". W 2023 22nd International Symposium on Parallel and Distributed Computing (ISPDC). IEEE, 2023. http://dx.doi.org/10.1109/ispdc59212.2023.00024.
Pełny tekst źródłaZhou, Wei, K. Preston White i Hongfeng Yu. "Improving Short Job Latency Performance in Hybrid Job Schedulers with Dice". W ICPP 2019: 48th International Conference on Parallel Processing. New York, NY, USA: ACM, 2019. http://dx.doi.org/10.1145/3337821.3337851.
Pełny tekst źródłaKonovalov, Mikhail, i Rostislav Razumchik. "Minimizing Mean Response Time In Batch-Arrival Non-Observable Systems With Single-Server FIFO Queues Operating In Parallel". W 35th ECMS International Conference on Modelling and Simulation. ECMS, 2021. http://dx.doi.org/10.7148/2021-0272.
Pełny tekst źródłaRaporty organizacyjne na temat "Job parallèle"
Leung, Vitus Joseph, Gerald Sabin i Ponnuswamy Sadayappan. Parallel job scheduling policies to improve fairness : a case study. Office of Scientific and Technical Information (OSTI), luty 2008. http://dx.doi.org/10.2172/929521.
Pełny tekst źródła