• Van Tendeloo Y and Vangheluwe H. (2017). Increasing the performance of a Discrete Event System Specification simulator by means of computational resource usage “activity” models. SIMULATION. 10.1177/0037549717726595. 93:12. (1045-1061). Online publication date: 1-Dec-2017.

    http://journals.sagepub.com/doi/10.1177/0037549717726595

  • (2016). Continuous Random Variables. Probability and Statistics with Reliability, Queuing and Computer Science Applications. 10.1002/9781119285441.ch3. (121-200). Online publication date: 6-Sep-2016.

    https://onlinelibrary.wiley.com/doi/10.1002/9781119285441.ch3

  • Sudarsan R and Ribbens C. (2016). Combining performance and priority for scheduling resizable parallel applications. Journal of Parallel and Distributed Computing. 87:C. (55-66). Online publication date: 1-Jan-2016.

    https://doi.org/10.1016/j.jpdc.2015.09.007

  • Ghasemi M and Lubin B. Modeling multi-attribute demand for sustainable cloud computing with copulae. Proceedings of the 24th International Conference on Artificial Intelligence. (2596-2602).

    /doi/10.5555/2832581.2832612

  • Muzy A, Varenne F, Zeigler B, Caux J, Coquillard P, Touraille L, Prunetti D, Caillou P, Michel O and Hill D. (2012). Refounding of the activity concept? Towards a federative paradigm for modeling and simulation. SIMULATION. 10.1177/0037549712457852. 89:2. (156-177). Online publication date: 1-Feb-2013.

    http://journals.sagepub.com/doi/10.1177/0037549712457852

  • Nahir A, Orda A and Raz D. Distributed oblivious load balancing using prioritized job replication. Proceedings of the 8th International Conference on Network and Service Management. (55-63).

    /doi/10.5555/2499406.2499413

  • Chen X, Liu X, Wang S and Chang X. TailCon. Proceedings of the 2012 IEEE 31st Symposium on Reliable Distributed Systems. (61-70).

    https://doi.org/10.1109/SRDS.2012.72

  • Wang J, Qiao C, Sudhaakar R, Addepalli S, Jin Y and Argibay-Losada P. Flow Inspection Router Assignment (FIRA) in Access/Aggregation Network Clouds. Proceedings of the 2012 32nd International Conference on Distributed Computing Systems Workshops. (436-445).

    https://doi.org/10.1109/ICDCSW.2012.86

  • Hernández-Orallo E and Vila-Carbó J. (2012). On the nature and impact of self-similarity in real-time systems. Real-Time Systems. 48:3. (294-319). Online publication date: 1-May-2012.

    https://doi.org/10.1007/s11241-012-9146-0

  • Wang S, Munawar W, Liu J, Chen J and Liu X. Power-Saving Design for Server Farms with Response Time Percentile Guarantees. Proceedings of the 2012 IEEE 18th Real Time and Embedded Technology and Applications Symposium. (273-284).

    https://doi.org/10.1109/RTAS.2012.35

  • Singh H and Kumar S. (2012). Dispatcher Based Dynamic Load Balancing on Web Server System. International Journal of System Dynamics Applications. 1:2. (15-27). Online publication date: 1-Apr-2012.

    https://doi.org/10.4018/ijsda.2012040102

  • Jayasinghe M, Tari Z, Zeephongsekul P and Zomaya A. (2011). Task assignment in multiple server farms using preemptive migration and flow control. Journal of Parallel and Distributed Computing. 71:12. (1608-1621). Online publication date: 1-Dec-2011.

    https://doi.org/10.1016/j.jpdc.2011.07.001

  • Li T. (2011). Workload Portfolio Optimization for Virtualized Computer Systems Based on Semiparametric Quantile Function Estimation. Journal of the Royal Statistical Society Series C: Applied Statistics. 10.1111/j.1467-9876.2011.00764.x. 60:4. (519-539). Online publication date: 1-Aug-2011.

    https://academic.oup.com/jrsssc/article/60/4/519/7079253

  • Harchol‐Balter M. (2011). Queueing Disciplines. Wiley Encyclopedia of Operations Research and Management Science. 10.1002/9780470400531.eorms0699. Online publication date: 1-Jan-2011.

    https://onlinelibrary.wiley.com/doi/10.1002/9780470400531.eorms0699

  • Hernandez-Orallo E and Vila-Carbo J. Analysis of Self-Similar Workload on Real-Time Systems. Proceedings of the 2010 16th IEEE Real-Time and Embedded Technology and Applications Symposium. (343-352).

    https://doi.org/10.1109/RTAS.2010.13

  • Muzy A, Touraille L, Vangheluwe H, Michel O, Traoré M and Hill D. Activity regions for the specification of discrete event systems. Proceedings of the 2010 Spring Simulation Multiconference. (1-7).

    https://doi.org/10.1145/1878537.1878679

  • Kochut A, Beaty K, Shaikh H and Shea D. (2010). Desktop workload study with implications for desktop cloud resource optimization Distributed Processing, Workshops and Phd Forum (IPDPSW). 10.1109/IPDPSW.2010.5470723. 978-1-4244-6533-0. (1-8).

    http://ieeexplore.ieee.org/document/5470723/

  • Bertasi P, Pettarin A, Scquizzato M and Silvestri F. A novel resource-driven job allocation scheme for desktop grid environments. Proceedings of the 5th international conference on Trustworthly global computing. (268-283).

    /doi/10.5555/1893701.1893724

  • Bertasi P, Pettarin A, Scquizzato M and Silvestri F. (2010). A Novel Resource-Driven Job Allocation Scheme for Desktop Grid Environments. Trustworthly Global Computing. 10.1007/978-3-642-15640-3_18. (268-283).

    http://link.springer.com/10.1007/978-3-642-15640-3_18

  • Zheng H and Nieh J. (2009). WARP: Enabling fast CPU scheduler development and evaluation Software (ISPASS). 10.1109/ISPASS.2009.4919642. 978-1-4244-4184-6. (101-112).

    http://ieeexplore.ieee.org/document/4919642/

  • Bosque J, Herrero P, Salvadores M and Pérez M. A Collaborative-Aware Task Balancing Delivery Model for Clusters. Advances in Grid and Pervasive Computing. 10.1007/978-3-540-72360-8_13. (146-157).

    http://link.springer.com/10.1007/978-3-540-72360-8_13

  • Lin W, Liu Z, Xia C and Zhang L. (2005). Optimal capacity allocation for Web systems with end-to-end delay guarantees. Performance Evaluation. 62:1-4. (400-416). Online publication date: 1-Oct-2005.

    https://doi.org/10.1016/j.peva.2005.07.021

  • Nurmi D, Brevik J and Wolski R. Modeling machine availability in enterprise and wide-area distributed computing environments. Proceedings of the 11th international Euro-Par conference on Parallel Processing. (432-441).

    https://doi.org/10.1007/11549468_50

  • Younes H. Planning and execution with phase transitions. Proceedings of the 20th national conference on Artificial intelligence - Volume 2. (1030-1035).

    /doi/10.5555/1619410.1619498

  • Liabotis I, Prnjat O and Sacks L. (2004). SORD: Self-Organizing Resource Discovery Protocol for ALAN. Active Networks. 10.1007/978-3-540-24715-9_12. (127-136).

    http://link.springer.com/10.1007/978-3-540-24715-9_12

  • Sievert O and Casanova H. Policies for swapping MPI processes 12th IEEE International Symposium on High Performance Distributed Computing. 10.1109/HPDC.2003.1210020. 0-7695-1965-2. (104-113).

    http://ieeexplore.ieee.org/document/1210020/

  • Osogami T and Harchol-Balter M. (2003). Necessary and Sufficient Conditions for Representing General Distributions by Coxians. Computer Performance Evaluation. Modelling Techniques and Tools. 10.1007/978-3-540-45232-4_12. (182-199).

    http://link.springer.com/10.1007/978-3-540-45232-4_12

  • Dinda P. (2002). Online Prediction of the Running Time of Tasks. Cluster Computing. 5:3. (225-236). Online publication date: 1-Jul-2002.

    https://doi.org/10.1023/A:1015634802585

  • Burgess M, Haugerud H, Straumsnes S and Reitan T. (2002). Measuring system normality. ACM Transactions on Computer Systems. 20:2. (125-160). Online publication date: 1-May-2002.

    https://doi.org/10.1145/507052.507054

  • (2002). Task assignment with unknown duration. Journal of the ACM. 49:2. (260-288). Online publication date: 1-Mar-2002.

    https://doi.org/10.1145/506147.506154

  • Rosenberg A. (2002). Optimal Schedules for Cycle-Stealing in a Network of Workstations with a Bag-of-Tasks Workload. IEEE Transactions on Parallel and Distributed Systems. 13:2. (179-191). Online publication date: 1-Feb-2002.

    https://doi.org/10.1109/71.983945

  • Haugerud H and Straumsnes S. Simulation of User-Driven Computer Behaviour. Proceedings of the 15th USENIX conference on System administration. (101-108).

    /doi/10.5555/1047531.1047542

  • Crovella M. (2001). Performance Evaluation with Heavy Tailed Distributions. Job Scheduling Strategies for Parallel Processing. 10.1007/3-540-45540-X_1. (1-10).

    http://link.springer.com/10.1007/3-540-45540-X_1

  • Dinda P and O'Hallaron D. (2000). Host load prediction using linear models. Cluster Computing. 3:4. (265-280). Online publication date: 1-Oct-2000.

    https://doi.org/10.1023/A:1019048724544

  • Milojičić D, Douglis F, Paindaveine Y, Wheeler R and Zhou S. (2000). Process migration. ACM Computing Surveys. 32:3. (241-299). Online publication date: 1-Sep-2000.

    https://doi.org/10.1145/367701.367728

  • Rosenberg A. Optimal schedules for data-parallel cycle-stealing in networks of workstations (extended abstract). Proceedings of the twelfth annual ACM symposium on Parallel algorithms and architectures. (22-29).

    https://doi.org/10.1145/341800.341804

  • Rosenberg A. (1999). Guidelines for Data-Parallel Cycle-Stealing in Networks of Workstations. Journal of Parallel and Distributed Computing. 59:1. (31-53). Online publication date: 1-Oct-1999.

    https://doi.org/10.1006/jpdc.1999.1564

  • Dinda P. (1999). The statistical properties of host load. Scientific Programming. 7:3-4. (211-229). Online publication date: 1-Aug-1999.

    https://doi.org/10.1155/1999/386856

  • Hjálmtýsson G and Whitt W. (1998). Periodic load balancing. Queueing Systems: Theory and Applications. 30:1/2. (203-250). Online publication date: 14-Jun-1998.

    https://doi.org/10.1023/A:1019165004692

  • Dinda P. (1998). The Statistical Properties of Host Load. Languages, Compilers, and Run-Time Systems for Scalable Computers. 10.1007/3-540-49530-4_23. (319-334).

    http://link.springer.com/10.1007/3-540-49530-4_23

  • Dasgupta P, Majumder A and Bhattacharya P. (1997). V_THR. Journal of Parallel and Distributed Computing. 42:2. (101-108). Online publication date: 1-May-1997.

    https://doi.org/10.1006/jpdc.1997.1321

  • Downey A. Predicting Queue Times on Space-Sharing Parallel Computers. Proceedings of the 11th International Symposium on Parallel Processing. (209-218).

    /doi/10.5555/645607.661350

  • Harchol-Balter M and Downey A. Exploiting process lifetime distributions for dynamic load balancing. Proceedings of the 1996 ACM SIGMETRICS international conference on Measurement and modeling of computer systems. (13-24).

    https://doi.org/10.1145/233013.233019

  • Harchol-Balter M and Downey A. (1996). Exploiting process lifetime distributions for dynamic load balancing. ACM SIGMETRICS Performance Evaluation Review. 24:1. (13-24). Online publication date: 15-May-1996.

    https://doi.org/10.1145/233008.233019

  • Harchol-Balter M and Downey A. (1995). Exploiting process lifetime distributions for dynamic load balancing. ACM SIGOPS Operating Systems Review. 29:5. (236). Online publication date: 3-Dec-1995.

    https://doi.org/10.1145/224057.225838

  • Harchol-Balter M and Downey A. Exploiting process lifetime distributions for dynamic load balancing. Proceedings of the fifteenth ACM symposium on Operating systems principles.

    https://doi.org/10.1145/224056.225838

  • Goswami K, Devarakonda M and Iyer R. (1993). Prediction-Based Dynamic Load-Sharing Heuristics. IEEE Transactions on Parallel and Distributed Systems. 4:6. (638-648). Online publication date: 1-Jun-1993.

    https://doi.org/10.1109/71.242159

  • Abani K, Akingbehin K and Shaout A. Fuzzy decision making for load balancing in a distributed system 36th Midwest Symposium on Circuits and Systems. 10.1109/MWSCAS.1993.343011. 0-7803-1760-2. (500-502).

    http://ieeexplore.ieee.org/document/343011/

  • Rommel C. (1991). The Probability of Load Balancing Success in a Homogeneous Network. IEEE Transactions on Software Engineering. 17:9. (922-933). Online publication date: 1-Sep-1991.

    https://doi.org/10.1109/32.92912

  • Kunz T. (1991). The Influence of Different Workload Descriptions on a Heuristic Load Balancing Scheme. IEEE Transactions on Software Engineering. 17:7. (725-730). Online publication date: 1-Jul-1991.

    https://doi.org/10.1109/32.83908

  • Harget A and Johnson I. (1990). Load balancing algorithms in loosely-coupled distributed systems: a survey. Distributed Computer Systems. 10.1016/B978-0-408-02938-4.50008-5. (85-108).

    https://linkinghub.elsevier.com/retrieve/pii/B9780408029384500085

  • Banawan S and Zahorjan J. (1989). Load sharing in heterogeneous queueing systems IEEE INFOCOM '89, Proceedings of the Eighth Annual Joint Conference of the IEEE Computer and Communications Societies. 10.1109/INFCOM.1989.101521. 0-8186-1920-1. (731-739 vol.2).

    http://ieeexplore.ieee.org/document/101521/

  • Förster C. (1989). Adaptive allocation of computational requirements to heterogeneous networks. Kommunikation in verteilten Systemen. 10.1007/978-3-642-74570-6_23. (324-337).

    https://link.springer.com/10.1007/978-3-642-74570-6_23

  • Thajeel T and Abdulhassan A. (2021). A Comprehensive Survey on Software-Defined Networking Load Balancers 2021 4th International Iraqi Conference on Engineering Technology and Their Applications (IICETA). 10.1109/IICETA51758.2021.9717919. 978-1-6654-9461-8. (1-7).

    https://ieeexplore.ieee.org/document/9717919/

  • Agrawal K, Maglalang J and Fineman J. (2014). Cache-conscious scheduling of streaming pipelines on parallel machines with private caches 2014 21st International Conference on High Performance Computing (HiPC). 10.1109/HiPC.2014.7116893. 978-1-4799-5976-1. (1-12).

    http://ieeexplore.ieee.org/document/7116893/

  • Singh H and Kumar S. (2012). Dispatcher Based Dynamic Load Balancing on Web Server System. International Journal of System Dynamics Applications. 1:2. (15-27). Online publication date: 1-Apr-2012.

    https://doi.org/10.4018/ijsda.2012040102

  • Lee D and Wicker S. (2010). Can a routing protocol be truly optimal? dynamic load-balancing in wireless sensor networks IEEE 11th Annual Wireless and Microwave Technology Conference: An IEEE Industry/ Government/Education Conference (WAMICON 2010). 10.1109/WAMICON.2010.5461871. 978-1-4244-6688-7. (1-5).

    http://ieeexplore.ieee.org/document/5461871/

  • Kochut A. (2009). Power and performance modeling of virtualized desktop systems amp; Simulation of Computer and Telecommunication Systems (MASCOTS). 10.1109/MASCOT.2009.5366785. 978-1-4244-4927-9. (1-10).

    http://ieeexplore.ieee.org/document/5366785/

  • Xiong N, Yang L, Yi Pan , Vasilakos A and He J. Design and analysis of an active predictive algorithm in wireless multicast networks. Proceedings of the 2009 IEEE International Symposium on Parallel&Distributed Processing. (1-8).

    https://doi.org/10.1109/IPDPS.2009.5161170

  • Agrawal K, Leiserson C, He Y and Hsu W. (2008). Adaptive work-stealing with parallelism feedback. ACM Transactions on Computer Systems. 26:3. (1-32). Online publication date: 1-Sep-2008.

    https://doi.org/10.1145/1394441.1394443

  • Feitelson D. (2008). Looking at data Distributed Processing Symposium (IPDPS). 10.1109/IPDPS.2008.4536092. 978-1-4244-1693-6. (1-9).

    http://ieeexplore.ieee.org/document/4536092/

  • Choi M and Kim N. (2007). Performance Improvement using Effective Task Size Calculation in Dynamic Load Balancing Systems. The KIPS Transactions:PartA. 10.3745/KIPSTA.2007.14-A.6.357. 14A:6. (357-362). Online publication date: 31-Dec-2008.

    http://koreascience.or.kr/journal/view.jsp?kj=JBCREI&py=2007&vnc=v14An6&sp=357

  • Bosque J, Herrero P, Salvadores M and Pérez M. A collaborative-aware task balancing delivery model for clusters. Proceedings of the 2nd international conference on Advances in grid and pervasive computing. (146-157).

    /doi/10.5555/1759868.1759881

  • Wolski R, Nurmi D and Brevik J. (2007). An Analysis of Availability Distributions in Condor 2007 IEEE International Parallel and Distributed Processing Symposium. 10.1109/IPDPS.2007.370523. 1-4244-0909-8. (1-6).

    http://ieeexplore.ieee.org/document/4228251/

  • Bosque J, Herrero P, Salvadores M and Pérez M. A Collaborative-Aware Task Balancing Delivery Model for Clusters. Advances in Grid and Pervasive Computing. 10.1007/978-3-540-72360-8_13. (146-157).

    http://link.springer.com/10.1007/978-3-540-72360-8_13

  • Feitelson D. Metrics for Mass-Count Disparity. Proceedings of the 14th IEEE International Symposium on Modeling, Analysis, and Simulation. (61-68).

    https://doi.org/10.1109/MASCOTS.2006.30

  • Bossie C and Fiorini P. (2006). On checkpointing and heavy-tails in unreliable computing environments. ACM SIGMETRICS Performance Evaluation Review. 34:2. (13-15). Online publication date: 1-Sep-2006.

    https://doi.org/10.1145/1168134.1168142

  • Agrawal K, He Y and Leiserson C. An Empirical Evaluation ofWork Stealing with Parallelism Feedback. Proceedings of the 26th IEEE International Conference on Distributed Computing Systems.

    https://doi.org/10.1109/ICDCS.2006.14

  • Dobber M, van der Mei R and Koole G. Statistical Properties of Task Running Times in a Global-Scale Grid Environment. Proceedings of the Sixth IEEE International Symposium on Cluster Computing and the Grid. (150-153).

    https://doi.org/10.1109/CCGRID.2006.98

  • Psounis K, Molinero-Fernández P, Prabhakar B and Papadopoulos F. (2005). Systems with multiple servers under heavy-tailed workloads. Performance Evaluation. 62:1-4. (456-474). Online publication date: 1-Oct-2005.

    /doi/10.5555/1120164.1120194

  • Lin W, Liu Z, Xia C and Zhang L. (2005). Optimal capacity allocation for Web systems with end-to-end delay guarantees. Performance Evaluation. 62:1-4. (400-416). Online publication date: 1-Oct-2005.

    https://doi.org/10.1016/j.peva.2005.07.021

  • Fiorini P. (2005). Analytically Modeling Unreliable Parallel Processing Systems with General Task Time Distributions 2005 IEEE Intelligent Data Acquisition and Advanced Computing Systems: Technology and Applications. 10.1109/IDAACS.2005.282968. 0-7803-9446-1. (191-198).

    http://ieeexplore.ieee.org/document/4062119/

  • Nurmi D, Brevik J and Wolski R. Modeling machine availability in enterprise and wide-area distributed computing environments. Proceedings of the 11th international Euro-Par conference on Parallel Processing. (432-441).

    https://doi.org/10.1007/11549468_50

  • England D, Weissman J and Sadagopan J. A new metric for robustness with application to job scheduling. Proceedings of the High Performance Distributed Computing, 2005. HPDC-14. Proceedings. 14th IEEE International Symposium. (135-143).

    https://doi.org/10.1109/HPDC.2005.1520948

  • Wolski R, Nurmi D, Brevik J, Casanova H and Chien A. Models and Modeling Infrastructures for Global Computational Platforms. Proceedings of the 19th IEEE International Parallel and Distributed Processing Symposium (IPDPS'05) - Workshop 10 - Volume 11.

    https://doi.org/10.1109/IPDPS.2005.294

  • Mitra A, Maheswaran M and Ali S. Measuring Scalability of Resource Management Systems. Proceedings of the 19th IEEE International Parallel and Distributed Processing Symposium (IPDPS'05) - Workshop 1 - Volume 02.

    https://doi.org/10.1109/IPDPS.2005.277

  • Yifeng Shao , Feng Hong and Minglu Li . (2005). JSChord: A Peer-to-Peer System to Achieve Max Throughput Sixth International Conference on Parallel and Distributed Computing Applications and Technologies (PDCAT'05). 10.1109/PDCAT.2005.159. 0-7695-2405-2. (395-399).

    http://ieeexplore.ieee.org/document/1578942/

  • Cabrera J, Wenke Lee , Gosar J and Mehra R. Heavy tails and temporal correlations of processing times in network intrusion detection: characterization and consequences Proceedings from the Sixth Annual IEEE Systems, Man and Cybernetics (SMC) Information Assurance Workshop, 2005.. 10.1109/IAW.2005.1495941. 0-7803-9290-6. (109-117).

    http://ieeexplore.ieee.org/document/1495941/

  • Cabrera J, Gosar J, Lee W and Mehra R. (2004). On the statistical distribution of processing times in network intrusion detection 2004 43rd IEEE Conference on Decision and Control (CDC) (IEEE Cat. No.04CH37601). 10.1109/CDC.2004.1428609. 0-7803-8682-5. (75-80 Vol.1).

    http://ieeexplore.ieee.org/document/1428609/

  • Harchol-Balter M, Li C, Osogami T, Scheller-Wolf A and Squillante M. Cycle stealing under immediate dispatch task assignment. Proceedings of the fifteenth annual ACM symposium on Parallel algorithms and architectures. (274-285).

    https://doi.org/10.1145/777412.777462

  • Narayanan D and Satyanarayanan M. Predictive Resource Management for Wearable Computing. Proceedings of the 1st international conference on Mobile systems, applications and services. (113-128).

    https://doi.org/10.1145/1066116.1189041

  • Pitsianis N and Pechanek G. (2003). Indirect VLIW memory allocation for the ManArray multiprocessor DSP. ACM SIGARCH Computer Architecture News. 31:1. (69-74). Online publication date: 1-Mar-2003.

    https://doi.org/10.1145/773365.773373

  • Waddington D and Viswanathan R. (2002). Interaction points. ACM SIGOPS Operating Systems Review. 36:2. (19-35). Online publication date: 1-Apr-2002.

    https://doi.org/10.1145/509526.509531

  • Youhui Z and Dongsheng W. (2002). A checkpoint-based high availability run-time system for Windows NT clusters. ACM SIGOPS Operating Systems Review. 36:2. (12-18). Online publication date: 1-Apr-2002.

    https://doi.org/10.1145/509526.509530

  • Barr R, Bicket J, Dantas D, Du B, Kim T, Zhou B and Sirer E. (2002). On the need for system-level support for ad hoc and sensor networks. ACM SIGOPS Operating Systems Review. 36:2. (1-5). Online publication date: 1-Apr-2002.

    https://doi.org/10.1145/509526.509528

  • Rosenberg A. (2002). Optimal Schedules for Cycle-Stealing in a Network of Workstations with a Bag-of-Tasks Workload. IEEE Transactions on Parallel and Distributed Systems. 13:2. (179-191). Online publication date: 1-Feb-2002.

    https://doi.org/10.1109/71.983945

  • Feitelson D. (2002). Workload Modeling for Performance Evaluation. Performance Evaluation of Complex Systems: Techniques and Tools. 10.1007/3-540-45798-4_6. (114-141).

    http://link.springer.com/10.1007/3-540-45798-4_6

  • Grobauer B. (2001). Cost recurrences for DML programs. ACM SIGPLAN Notices. 36:10. (253-264). Online publication date: 1-Oct-2001.

    https://doi.org/10.1145/507669.507666

  • Zenger M and Odersky M. (2001). Extensible algebraic datatypes with defaults. ACM SIGPLAN Notices. 36:10. (241-252). Online publication date: 1-Oct-2001.

    https://doi.org/10.1145/507669.507665

  • Paterson R. (2001). A new notation for arrows. ACM SIGPLAN Notices. 36:10. (229-240). Online publication date: 1-Oct-2001.

    https://doi.org/10.1145/507669.507664

  • Chakravarty M and Keller G. (2001). Functional array fusion. ACM SIGPLAN Notices. 36:10. (205-216). Online publication date: 1-Oct-2001.

    https://doi.org/10.1145/507669.507661

  • Chitil O. (2001). Compositional explanation of types and algorithmic debugging of type errors. ACM SIGPLAN Notices. 36:10. (193-204). Online publication date: 1-Oct-2001.

    https://doi.org/10.1145/507669.507659

  • Floyd S and Paxson V. (2001). Difficulties in simulating the internet. IEEE/ACM Transactions on Networking. 9:4. (392-403). Online publication date: 1-Aug-2001.

    https://doi.org/10.1109/90.944338

  • Bansal N and Harchol-Balter M. (2001). Analysis of SRPT scheduling. ACM SIGMETRICS Performance Evaluation Review. 29:1. (279-290). Online publication date: 1-Jun-2001.

    https://doi.org/10.1145/384268.378792

  • Bansal N and Harchol-Balter M. Analysis of SRPT scheduling. Proceedings of the 2001 ACM SIGMETRICS international conference on Measurement and modeling of computer systems. (279-290).

    https://doi.org/10.1145/378420.378792

  • Squillante M, Woo B and Zhang L. (2001). Analysis of queues under correlated arrivals with applications to web server performance. ACM SIGMETRICS Performance Evaluation Review. 28:4. (41-43). Online publication date: 1-Mar-2001.

    https://doi.org/10.1145/544397.544413

  • Fernandes P and Plateau B. (2001). Triangular solution of linear systems in tensor product format. ACM SIGMETRICS Performance Evaluation Review. 28:4. (30-32). Online publication date: 1-Mar-2001.

    https://doi.org/10.1145/544397.544409

  • Hogstedt K, Kimelman D, Rajan V, Roth T and Wegman M. (2001). Graph cutting algorithms for distributed applications partitioning. ACM SIGMETRICS Performance Evaluation Review. 28:4. (27-29). Online publication date: 1-Mar-2001.

    https://doi.org/10.1145/544397.544408

  • de Souza e Silva E, Leão R and Diniz M. (2001). Transient analysis applied to traffic modeling. ACM SIGMETRICS Performance Evaluation Review. 28:4. (14-16). Online publication date: 1-Mar-2001.

    https://doi.org/10.1145/544397.544403

  • Wolf J and Yu P. (2001). Load balancing for clustered web farms. ACM SIGMETRICS Performance Evaluation Review. 28:4. (11-13). Online publication date: 1-Mar-2001.

    https://doi.org/10.1145/544397.544402

  • Harchol-Balter M. (2001). Job placement with unknown duration and no preemption. ACM SIGMETRICS Performance Evaluation Review. 28:4. (3-5). Online publication date: 1-Mar-2001.

    https://doi.org/10.1145/544397.544399

  • Chang W. A resource efficient scheme for network service recovery in a cluster IEEE International Conference on Systems, Man & Cybernetics. 10.1109/ICSMC.2001.973064. 0-7803-7087-2. (1087-1091).

    http://ieeexplore.ieee.org/document/973064/

  • Dinda P. Online prediction of the running time of tasks 10th IEEE International Symposium on High Performance Distributed Computing. 10.1109/HPDC.2001.945206. 0-7695-1296-8. (383-394).

    http://ieeexplore.ieee.org/document/945206/

  • Harchol-Balter M, Bansal N, Schroeder B and Agrawal M. (2001). SRPT Scheduling for Web Servers. Job Scheduling Strategies for Parallel Processing. 10.1007/3-540-45540-X_2. (11-20).

    http://link.springer.com/10.1007/3-540-45540-X_2

  • Feitelson D. (2001). Metrics for Parallel Job Scheduling and Their Convergence. Job Scheduling Strategies for Parallel Processing. 10.1007/3-540-45540-X_11. (188-205).

    http://link.springer.com/10.1007/3-540-45540-X_11

  • Ryu K and Hollingsworth J. (2000). Exploiting Fine-Grained Idle Periods in Networks of Workstations. IEEE Transactions on Parallel and Distributed Systems. 11:7. (683-698). Online publication date: 1-Jul-2000.

    https://doi.org/10.1109/71.877793

  • Harchol-Balter M. Task assignment with unknown duration 20th IEEE International Conference on Distributed Computing Systems. 10.1109/ICDCS.2000.840932. 0-7695-0601-1. (214-224).

    http://ieeexplore.ieee.org/document/840932/

  • Anglano C. A comparative evaluation of implicit coscheduling strategies for networks of workstations Ninth International Symposium on High-Performance Distributed Computing. 10.1109/HPDC.2000.868653. 0-7695-0783-2. (221-228).

    http://ieeexplore.ieee.org/document/868653/

  • Crovella M. (2000). Performance Evaluation with Heavy Tailed Distributions. Computer Performance Evaluation.Modelling Techniques and Tools. 10.1007/3-540-46429-8_1. (1-9).

    http://link.springer.com/10.1007/3-540-46429-8_1

  • Dinda P. (1999). The statistical properties of host load. Scientific Programming. 7:3-4. (211-229). Online publication date: 1-Aug-1999.

    https://doi.org/10.1155/1999/386856

  • Dinda P and O'Hallaron D. An evaluation of linear models for host load prediction Proceedings. The Eighth International Symposium on High Performance Distributed Computing. 10.1109/HPDC.1999.805285. 0-7803-5681-0. (87-96).

    http://ieeexplore.ieee.org/document/805285/

  • Ryu K and Hollingsworth J. Linger Longer. Proceedings of the 1998 ACM/IEEE conference on Supercomputing. (1-12).

    /doi/10.5555/509058.509102

  • Jue J and Ghosal D. (1998). Design and analysis of a replicated server architecture for supporting IP-Host mobility. ACM SIGMOBILE Mobile Computing and Communications Review. 2:3. (16-23). Online publication date: 1-Jul-1998.

    https://doi.org/10.1145/1321387.1321388

  • Jue J and Ghosal D. (1998). Design and analysis of a replicated server architecture for supporting IP-host mobility. Cluster Computing. 1:2. (249-260). Online publication date: 1-Apr-1998.

    https://doi.org/10.1023/A:1019097818667

  • Kyung Dong Ryu and Hollingsworth J. (1998). Fine-Grain Cycle Stealing for Networks of Workstations SC98 - High Performance Networking and Computing Conference. 10.1109/SC.1998.10011. 0-8186-8707-X. (45-45).

    http://ieeexplore.ieee.org/document/1437332/

  • Harchol-Balter M, Crovella M and Murta C. (1998). On Choosing a Task Assignment Policy for a Distributed Server System. Computer Performance Evaluation. 10.1007/3-540-68061-6_19. (231-242).

    http://link.springer.com/10.1007/3-540-68061-6_19

  • Harchol-Balter M and Downey A. (1997). Exploiting process lifetime distributions for dynamic load balancing. ACM Transactions on Computer Systems. 15:3. (253-285). Online publication date: 1-Aug-1997.

    https://doi.org/10.1145/263326.263344

  • Dandamudi S. The effect of scheduling discipline on dynamic load sharing in heterogeneous distributed systems Fifth International Symposium on Modeling, Analysis, and Simulation of Computer and Telecommunication Systems. 10.1109/MASCOT.1997.567574. 0-8186-7758-9. (17-24).

    http://ieeexplore.ieee.org/document/567574/

  • Dandamudi S and Lo K. A hierarchical load sharing policy for distributed systems Fifth International Symposium on Modeling, Analysis, and Simulation of Computer and Telecommunication Systems. 10.1109/MASCOT.1997.567572. 0-8186-7758-9. (3-10).

    http://ieeexplore.ieee.org/document/567572/

  • Downey A. Predicting queue times on space-sharing parallel computers 11th International Parallel Processing Symposium. 10.1109/IPPS.1997.580894. 0-8186-7793-7. (209-218).

    http://ieeexplore.ieee.org/document/580894/

  • Nuttall M and Sloman M. Workload characteristics for process migration and load balancing 17th International Conference on Distributed Computing Systems. 10.1109/ICDCS.1997.597896. 0-8186-7813-5. (133-140).

    http://ieeexplore.ieee.org/document/597896/

  • Ju J, Xu G and Yang K. (1996). On-line predicting behaviors of jobs in dynamic load balancing. Journal of Computer Science and Technology. 10.1007/BF02943520. 11:1. (39-48). Online publication date: 1-Jan-1996.

    http://link.springer.com/10.1007/BF02943520

  • Harchol-Balter M and Downey A. (1995). Exploiting process lifetime distributions for dynamic load balancing. ACM SIGOPS Operating Systems Review. 29:5. (236). Online publication date: 3-Dec-1995.

    https://doi.org/10.1145/224057.225838

  • Harchol-Balter M and Downey A. Exploiting process lifetime distributions for dynamic load balancing. Proceedings of the fifteenth ACM symposium on Operating systems principles.

    https://doi.org/10.1145/224056.225838

  • Brunstrom A, Leutenegger S and Simha R. Experimental evaluation of dynamic data allocation strategies in a distributed database with changing workloads. Proceedings of the fourth international conference on Information and knowledge management. (395-402).

    https://doi.org/10.1145/221270.221652

  • Ponnusamy R, Saltz J, Choudhary A, Hwang Y and Fox G. (1995). Runtime Support and Compilation Methods for User-Specified Irregular Data Distributions. IEEE Transactions on Parallel and Distributed Systems. 6:8. (815-831). Online publication date: 1-Aug-1995.

    https://doi.org/10.1109/71.406958

  • Paxson V and Floyd S. (1995). Wide area traffic. IEEE/ACM Transactions on Networking. 3:3. (226-244). Online publication date: 1-Jun-1995.

    https://doi.org/10.1109/90.392383

  • Hwang Y, Moon B, Sharma S, Ponnusamy R, Das R and Saltz J. (1995). Runtime and language support for compiling adaptive irregular programs on distributed-memory machines. Software—Practice & Experience. 25:6. (597-621). Online publication date: 1-Jun-1995.

    https://doi.org/10.1002/spe.4380250603

  • McCann C and Zahorjan J. Scheduling memory constrained jobs on distributed memory parallel computers. Proceedings of the 1995 ACM SIGMETRICS joint international conference on Measurement and modeling of computer systems. (208-219).

    https://doi.org/10.1145/223587.223610

  • McCann C and Zahorjan J. (1995). Scheduling memory constrained jobs on distributed memory parallel computers. ACM SIGMETRICS Performance Evaluation Review. 23:1. (208-219). Online publication date: 1-May-1995.

    https://doi.org/10.1145/223586.223610

  • Ju J, Xu G and Yang K. (1995). An intelligent dynamic load balancer for workstation clusters. ACM SIGOPS Operating Systems Review. 29:1. (7-16). Online publication date: 11-Jan-1995.

    https://doi.org/10.1145/202453.202455

  • Weiping Zhu . Dynamic load balancing on Amoeba 1st International Conference on Algorithms and Architectures for Parallel Processing. 10.1109/ICAPP.1995.472205. 0-7803-2018-2. (355-364).

    http://ieeexplore.ieee.org/document/472205/

  • Benmohammed-Mahieddine K and Dew P. (1994). A periodic symmetrically-initiated load balancing algorithm for distributed systems. ACM SIGOPS Operating Systems Review. 28:1. (66-79). Online publication date: 1-Jan-1994.

    https://doi.org/10.1145/164853.164875

  • Seung Ho Cho and Seung Ryeol Choi . History-based adaptive load sharing heuristics TENCON'94 - 1994 IEEE Region 10's 9th Annual International Conference on: 'Frontiers of Computer Technology'. 10.1109/TENCON.1994.369316. 0-7803-1862-5. (161-165).

    http://ieeexplore.ieee.org/document/369316/

  • Elleuch A and Muntean T. Process migration protocols for massively parallel systems First International Conference on Massively Parallel Computing Systems (MPCS) The Challenges of General-Purpose and Special-Purpose Computing. 10.1109/MPCS.1994.367089. 0-8186-6322-7. (84-95).

    http://ieeexplore.ieee.org/document/367089/

  • Benmohammed-Mahieddine K, Dew P and Kara M. A periodic symmetrically-initiated load balancing algorithm for distributed systems 14th International Conference on Distributed Computing Systems. 10.1109/ICDCS.1994.302478. 0-8186-5840-1. (616-623).

    http://ieeexplore.ieee.org/document/302478/

  • Steketee E, Wei Ping Zhu and Moseley P. Implementation of process migration in Amoeba 14th International Conference on Distributed Computing Systems. 10.1109/ICDCS.1994.302411. 0-8186-5840-1. (194-201).

    http://ieeexplore.ieee.org/document/302411/

  • Elleuch A, Kanawati R, Muntean T and Talbi E. (1994). Dynamic load balancing mechanisms for a parallel operating system kernel. Parallel Processing: CONPAR 94 — VAPP VI. 10.1007/3-540-58430-7_75. (866-877).

    http://link.springer.com/10.1007/3-540-58430-7_75

  • Philippe L and Perrin G. (1994). Distributed scheduling for multicomputers. High-Performance Computing and Networking. 10.1007/3-540-57981-8_142. (344-349).

    http://link.springer.com/10.1007/3-540-57981-8_142

  • Ponnusamy R, Saltz J and Choudhary A. Runtime compilation techniques for data partitioning and communication schedule reuse. Proceedings of the 1993 ACM/IEEE conference on Supercomputing. (361-370).

    https://doi.org/10.1145/169627.169752

  • Goswami K, Devarakonda M and Iyer R. (1993). Prediction-Based Dynamic Load-Sharing Heuristics. IEEE Transactions on Parallel and Distributed Systems. 4:6. (638-648). Online publication date: 1-Jun-1993.

    https://doi.org/10.1109/71.242159

  • Banawan S and Zeidat N. A comparative study of load sharing in heterogeneous multicomputer systems. Proceedings of the 25th annual symposium on Simulation. (22-31).

    /doi/10.5555/306902.306921

  • Mutka M. (1992). Estimating Capacity for Sharing in a Privately Owned Workstation Environment. IEEE Transactions on Software Engineering. 18:4. (319-328). Online publication date: 1-Apr-1992.

    https://doi.org/10.1109/32.129220

  • Mutka M. (1992). An examination of strategies for estimating capacity to share among private workstations. ACM SIGSMALL/PC Notes. 18:1-2. (53-61). Online publication date: 1-Mar-1992.

    https://doi.org/10.1145/134307.134334

  • Banawan S and Zeidat N. A comparative study of load sharing in heterogeneous multicomputer systems Proceedings. 25th Annual Simulation Symposium. 10.1109/SIMSYM.1992.227580. 0-8186-2765-4. (22-31).

    http://ieeexplore.ieee.org/document/227580/

  • Svensson A. (1992). Dynamic alternation between load sharing algorithms Proceedings of the Twenty-Fifth Hawaii International Conference on System Sciences. 10.1109/HICSS.1992.183163. 0-8186-2420-5. (193-201 vol.1).

    http://ieeexplore.ieee.org/document/183163/

  • Greenberg A and Wright P. (1991). Design and Analysis of Master/Slave Multiprocessors. IEEE Transactions on Computers. 40:8. (963-976). Online publication date: 1-Aug-1991.

    https://doi.org/10.1109/12.83640

  • Kunz T. (1991). The Influence of Different Workload Descriptions on a Heuristic Load Balancing Scheme. IEEE Transactions on Software Engineering. 17:7. (725-730). Online publication date: 1-Jul-1991.

    https://doi.org/10.1109/32.83908

  • Squillante M and Nelson R. (1991). Analysis of task migration in shared-memory multiprocessor scheduling. ACM SIGMETRICS Performance Evaluation Review. 19:1. (143-155). Online publication date: 2-Jun-1991.

    https://doi.org/10.1145/107972.107987

  • Mutka M. An examination of strategies for estimating capacity to share among private workstations. Proceedings of the 1991 ACM SIGSMALL/PC symposium on Small systems. (41-49).

    https://doi.org/10.1145/111048.111054

  • Squillante M and Nelson R. Analysis of task migration in shared-memory multiprocessor scheduling. Proceedings of the 1991 ACM SIGMETRICS conference on Measurement and modeling of computer systems. (143-155).

    https://doi.org/10.1145/107971.107987

  • Theimer M and Hayes B. Heterogeneous process migration by recompilation 11th International Conference on Distributed Computing Systems. 10.1109/ICDCS.1991.148637. 0-8186-2144-3. (18-25).

    http://ieeexplore.ieee.org/document/148637/

  • Mutka M. A comparison of workload models of the capacity available for sharing among privately owned workstations Twenty-Fourth Annual Hawaii International Conference on System Sciences. 10.1109/HICSS.1991.183905. . (353-362).

    http://ieeexplore.ieee.org/document/183905/

  • Banawan S and Zahorjan J. On comparing load indices using oracle simulation. Proceedings of the 22nd conference on Winter simulation. (851-856).

    /doi/10.5555/328885.329264

  • Banawan S and Zahorjan J. On comparing load indices using oracle simulation 1990 Winter Simulation Conference. 10.1109/WSC.1990.129625. 0-911801-72-3. (851-856).

    http://ieeexplore.ieee.org/document/129625/

  • Svensson A. History, an intelligent load sharing filter 10th International Conference on Distributed Computing Systems. 10.1109/ICDCS.1990.89262. 0-8186-2048-X. (546-553).

    http://ieeexplore.ieee.org/document/89262/

  • Devarakonda M and Iyer R. (1989). Predictability of Process Resource Usage. IEEE Transactions on Software Engineering. 15:12. (1579-1586). Online publication date: 1-Dec-1989.

    https://doi.org/10.1109/32.58769

  • Dikshit P, Tripathi S and Jalote P. (1989). SHAYOG: a test bed for evaluation dynamic load-sharing policies. Software—Practice & Experience. 19:5. (411-435). Online publication date: 1-May-1989.

    https://doi.org/10.1002/spe.4380190502

  • Goswami K, Iyer R and Devarakonda M. Load sharing based on task resource prediction [1989] Twenty-Second Annual Hawaii International Conference on System Sciences. Volume II: Software Track. 10.1109/HICSS.1989.48103. 0-8186-1912-0. (921-927).

    http://ieeexplore.ieee.org/document/48103/

  • Walter D. (1988). Creativity and expert systems: a divergence of the minds. ACM SIGCAS Computers and Society. 18:4. (5-10). Online publication date: 1-Oct-1988.

    https://doi.org/10.1145/57124.57125

  • Zhou S. (1988). A Trace-Driven Simulation Study of Dynamic Load Balancing. IEEE Transactions on Software Engineering. 14:9. (1327-1341). Online publication date: 1-Sep-1988.

    https://doi.org/10.1109/32.6176

  • Smith J. (1988). A survey of process migration mechanisms. ACM SIGOPS Operating Systems Review. 22:3. (28-40). Online publication date: 1-Jul-1988.

    https://doi.org/10.1145/47671.47673

  • Eager D, Lazowska E and Zahorjan J. The limited performance benefits of migrating active processes for load sharing. Proceedings of the 1988 ACM SIGMETRICS conference on Measurement and modeling of computer systems. (63-72).

    https://doi.org/10.1145/55595.55604

  • Eager D, Lazowska E and Zahorjan J. (1988). The limited performance benefits of migrating active processes for load sharing. ACM SIGMETRICS Performance Evaluation Review. 16:1. (63-72). Online publication date: 1-May-1988.

    https://doi.org/10.1145/1007771.55604

  • Weinrib A and Shenker S. (1988). Greed is not enough: adaptive load sharing in large heterogeneous systems IEEE INFOCOM '88,Seventh Annual Joint Conference of the IEEE Computer and Communcations Societies. Networks: Evolution or Revolution?. 10.1109/INFCOM.1988.13015. 0-8186-0833-1. (986-994).

    https://ieeexplore.ieee.org/document/13015/

  • Krueger P and Livny M. A comparison of preemptive and non-preemptive load distributing [1988] Proceedings. The 8th International Conference on Distributed. 10.1109/DCS.1988.12509. 0-8186-0865-X. (123-130).

    http://ieeexplore.ieee.org/document/12509/

  • McDaniel G. (1982). An analysis of a mesa instruction set using dynamic instruction frequencies. ACM SIGARCH Computer Architecture News. 10:2. (167-176). Online publication date: 1-Mar-1982.

    https://doi.org/10.1145/964750.801840

  • Johnson M. (1982). Some requirements for architectural support of software debugging. ACM SIGARCH Computer Architecture News. 10:2. (140-148). Online publication date: 1-Mar-1982.

    https://doi.org/10.1145/964750.801837

  • Pollack F, Cox G, Hammerstrom D, Kahn K, Lai K and Rattner J. (1982). Supporting ada memory management in the iAPX-432. ACM SIGARCH Computer Architecture News. 10:2. (117-131). Online publication date: 1-Mar-1982.

    https://doi.org/10.1145/964750.801835

  • Wilkes M. (1982). Hardware support for memory protection. ACM SIGARCH Computer Architecture News. 10:2. (107-116). Online publication date: 1-Mar-1982.

    https://doi.org/10.1145/964750.801834

  • Ditzel D and McLellan H. (1982). Register allocation for free. ACM SIGARCH Computer Architecture News. 10:2. (48-56). Online publication date: 1-Mar-1982.

    https://doi.org/10.1145/964750.801825

  • Johnsson R and Wick J. (1982). An overview of the mesa processor architecture. ACM SIGARCH Computer Architecture News. 10:2. (20-29). Online publication date: 1-Mar-1982.

    https://doi.org/10.1145/964750.801822

  • Rymarczyk J. (1982). Coding guidelines for pipelined processors. ACM SIGARCH Computer Architecture News. 10:2. (12-19). Online publication date: 1-Mar-1982.

    https://doi.org/10.1145/964750.801821

  • Hennessy J, Jouppi N, Baskett F, Gross T and Gill J. (1982). Hardware/software tradeoffs for increased performance. ACM SIGARCH Computer Architecture News. 10:2. (2-11). Online publication date: 1-Mar-1982.

    https://doi.org/10.1145/964750.801820