Job Scheduling in Multiprogrammed Parallel Systems
暂无分享,去创建一个
[1] Tom Nute,et al. A compendium of processor allocation strategies for two-dimensional mesh connected systems , 1995, Concurr. Pract. Exp..
[2] Lionel M. Ni,et al. Contention-Free 2D-Mesh Cluster Allocation in Hypercubes , 1993, 1993 International Conference on Parallel Processing - ICPP'93.
[3] Jean-Louis Pazat,et al. Pandore: a system to manage data distribution , 1990, ICS '90.
[4] Dror G. Feitelson,et al. Memory Usage in the LANL CM-5 Workload , 1997, JSSPP.
[5] Satish K. Tripathi,et al. The Processor Working Set and Its Use in Scheduling Multiprocessor Systems , 1991, IEEE Trans. Software Eng..
[6] Jingshown Wu,et al. Scheduling parallel programs with non-uniform parallelism profiles , 1991, Proceedings of the 1991 ACM/IEEE Conference on Supercomputing (Supercomputing '91).
[7] Prithviraj Banerjee,et al. Parallel Simulated Annealing Algorithms for Cell Placement on Hypercube Multiprocessors , 1990, IEEE Trans. Parallel Distributed Syst..
[8] Philip S. Yu,et al. Scheduling parallelizable tasks to minimize average response time , 1994, SPAA '94.
[9] Gyungho Lee,et al. The Effectiveness of Combining in Shared Memory Parallel Computer in the Presence of "Hot Spots" , 1986, ICPP.
[10] David A. Lifka,et al. The ANL/IBM SP Scheduling System , 1995, JSSPP.
[11] James Cownie,et al. Message Passing on the Meiko CS-2 , 1994, Parallel Comput..
[12] Reinhard Männer. Hardware Task/Processor Scheduling in a Polyprocessor Environment , 1984, IEEE Trans. Computers.
[13] Jonathan Walpole,et al. Adaptive load migration systems for PVM , 1994, Proceedings of Supercomputing '94.
[14] Giuseppe Serazzi,et al. Analysis of Non-Work-Conserving Processor Partitioning Policies , 1995, JSSPP.
[15] Ten-Hwang Lai,et al. Preemptive Scheduling of Independent Jobs on a Hypercube , 1988, Inf. Process. Lett..
[16] Kenneth C. Sevcik,et al. Benefits of Speedup Knowledge in Memory-Constrained Multiprocessor Scheduling , 1996, Perform. Evaluation.
[17] William Saphir,et al. Job Management Requirements for NAS Parallel Systems and Clusters , 1995, JSSPP.
[18] Reinhard Männer,et al. The Heidelberg POLYP multiprocessor project , 1989 .
[19] Ronald H. Perrott,et al. A Language for Array and Vector Processors , 1979, TOPL.
[20] Ewing L. Lusk,et al. Monitors, Messages, and Clusters: The p4 Parallel Programming System , 1994, Parallel Comput..
[21] T. Kunz. The Innuence of Diierent Workload Descriptions on a Heuristic Load Balancing Scheme the Innuence of Diierent Workload Descriptions on a Heuristic Load Balancing Scheme , 2007 .
[22] Krishna R. Pattipati,et al. Scheduling parallelizable tasks: putting it all on the shelf , 1992, SIGMETRICS '92/PERFORMANCE '92.
[23] R. Chawla,et al. The Stealth distributed scheduler , 1991, [1991] Proceedings. 11th International Conference on Distributed Computing Systems.
[24] Larry Rudolph,et al. Evaluation of Design Choices for Gang Scheduling Using Distributed Hierarchical Control , 1996, J. Parallel Distributed Comput..
[25] David Scott,et al. A TeraFLOP supercomputer in 1996: the ASCI TFLOP system , 1996, Proceedings of International Conference on Parallel Processing.
[26] Robert D. Blumofe,et al. Scheduling large-scale parallel computations on networks of workstations , 1994, Proceedings of 3rd IEEE International Symposium on High Performance Distributed Computing.
[27] J. Palmer,et al. Connection Machine model CM-5 system overview , 1992, [Proceedings 1992] The Fourth Symposium on the Frontiers of Massively Parallel Computation.
[28] Peter J. Denning,et al. Working Sets Past and Present , 1980, IEEE Transactions on Software Engineering.
[29] Roy H. Campbell,et al. Choices, frameworks and refinement , 1991, Proceedings 1991 International Workshop on Object Orientation in Operating Systems.
[30] Honbo Zhou,et al. The EASY - LoadLeveler API Project , 1996, JSSPP.
[31] Virgil D. Gligor,et al. A Comparative Analysis of Multiprocessor Scheduling Algorithms , 1987, ICDCS.
[32] Bryan S. Rosenburg. Low-synchronization translation lookaside buffer consistency in large-scale shared-memory multiprocessors , 1989, SOSP '89.
[33] V. K. Naik,et al. Performance analysis of job scheduling policies in parallel supercomputing environments , 1993, Supercomputing '93.
[34] Charles L. Seitz,et al. The cosmic cube , 1985, CACM.
[35] Edward G. Coffman,et al. Bin packing with divisible item sizes , 1987, J. Complex..
[36] T. Doeppner,et al. Variable Weight Processes with Flexible Shared Resources ∗ , 1989 .
[37] Ron Cytron. Doacross: Beyond Vectorization for Multiprocessors , 1986, ICPP.
[38] P. Pierce,et al. The Paragon implementation of the NX message passing interface , 1994, Proceedings of IEEE Scalable High Performance Computing Conference.
[39] Anoop Gupta,et al. The DASH Prototype: Logic Overhead and Performance , 1993, IEEE Trans. Parallel Distributed Syst..
[40] Margaret A. Schaar,et al. Performance of co-scheduling on a network of workstations , 1993, [1993] Proceedings. The 13th International Conference on Distributed Computing Systems.
[41] E. Barszcz. Intercube communication for the iPSC/860 , 1992, Proceedings Scalable High Performance Computing Conference SHPCC-92..
[42] M NiLionel,et al. Design Tradeoffs for Process Scheduling in Shared Memory Multiprocessor Systems , 1989 .
[43] Leslie G. Valiant,et al. A bridging model for parallel computation , 1990, CACM.
[44] Krithi Ramamritham,et al. The Spring kernel: a new paradigm for real-time operating systems , 1989, OPSR.
[45] Larry Rudolph,et al. Mapping and Scheduling in a Shared Parallel Environment Using Distributed Hierarchical Control , 1990, ICPP.
[46] Dick H. J. Epema,et al. An analysis of decay-usage scheduling in multiprocessors , 1995, SIGMETRICS '95/PERFORMANCE '95.
[47] Ravishankar K. Iyer,et al. Modeling and Measuring Multiprogramming and System Overheads on a Shared-Memory Multiprocessor: Case Study , 1991, J. Parallel Distributed Comput..
[48] Mor Harchol-Balter,et al. Exploiting process lifetime distributions for dynamic load balancing , 1995, SIGMETRICS.
[49] José E. Moreira,et al. Autoscheduling in a Distributed Shared-Memory Environment , 1994, LCPC.
[50] Michel Dubois,et al. Synchronization, coherence, and event ordering in multiprocessors , 1988, Computer.
[51] Michel Dubois,et al. Dynamic page migration in multiprocessors with distributed global memory , 1988, [1988] Proceedings. The 8th International Conference on Distributed.
[52] Dhiraj K. Pradhan,et al. Subcube Level Time-Sharing in Hypercube Multicomputers , 1994, 1994 Internatonal Conference on Parallel Processing Vol. 2.
[53] Edward D. Lazowska,et al. Adding Scheduler Activations to Mach 3.0 , 1993, USENIX MACH Symposium.
[54] Thu D. Nguyen,et al. Using Runtime Measured Workload Characteristics in Parallel Processor Scheduling , 1996, JSSPP.
[55] Mario J. Gonzalez. Deterministic Processor Scheduling , 1977, CSUR.
[56] Narain H. Gehani,et al. Experience with Multiple Processor Versions of Concurrent C , 1989, IEEE Trans. Software Eng..
[57] Manfred Morari,et al. The Design and Evolution of Zipcode , 1994, Parallel Comput..
[58] John A. Stankovic,et al. Stability and Distributed Scheduling Algorithms , 1985, IEEE Transactions on Software Engineering.
[59] Carl H. Hauser,et al. The portable common runtime approach to interoperability , 1989, SOSP '89.
[60] Edward M. Reingold,et al. Scheduling on a Hypercube , 1991, Inf. Process. Lett..
[61] Maurice J. Bach. The Design of the UNIX Operating System , 1986 .
[62] J. Kim,et al. A Top-Down Processor Allocation Scheme for Hypercube Computers , 1991, IEEE Trans. Parallel Distributed Syst..
[63] Dror G. Feitelson,et al. Parallel I/O subsystems in massively parallel supercomputers , 1995, IEEE Parallel & Distributed Technology: Systems & Applications.
[64] Jørgen Staunstrup,et al. Problem-heap: A Paradigm for Multiprocessor Algorithms , 1985 .
[65] Takashi Masuda,et al. A thread facility based on user/kernel cooperation in the XERO operating system , 1991, [1991] Proceedings The Fifteenth Annual International Computer Software & Applications Conference.
[66] Allan Porterfield,et al. Exploiting heterogeneous parallelism on a multithreaded multiprocessor , 1992, ICS '92.
[67] Larry Rudolph,et al. ParC - An Extension of C for Shared Memory Parallel Processing , 1996, Softw. Pract. Exp..
[68] David J. DeWitt,et al. Processor allocation strategies for multiprocessor database machines , 1981, TODS.
[69] Allan Gottlieb. Avoiding Serial Bottlenecks in Ultraparallel MIMD Computers , 1984, COMPCON.
[70] Amnon Barak,et al. The MOSIX Distributed Operating System: Load Balancing for UNIX , 1993 .
[71] Tilak Agerwala,et al. SP2 System Architecture , 1999, IBM Syst. J..
[72] R. J. van der Pas,et al. Parallelism in a multi-user environment , 1991, Parallel Comput..
[73] Ronald Mraz. Reducing the variance of point-to-point transfers for parallel real-time programs , 1994, IEEE Parallel & Distributed Technology: Systems & Applications.
[74] Wei Shu. Adaptive Dynamic Process Scheduling on Distributed Memory Parallel Computers , 1994, Sci. Program..
[75] Charles L. Seitz. Concurrent architectures , 1990 .
[76] Michael L. Scott,et al. Scheduler-conscious synchronization , 1997, TOCS.
[77] James C. Browne. TRAC: An Environment for Parallel Computing , 1984, COMPCON.
[78] Ten-Hwang Lai,et al. Scheduling Independent Jobs on Hypercubes , 1988, STACS.
[79] Reinhard Männer,et al. The Heidelberg Polyp System , 1987, IEEE Micro.
[80] Vaidy S. Sunderam,et al. PVM: A Framework for Parallel Distributed Computing , 1990, Concurr. Pract. Exp..
[81] Dan C. Marinescu,et al. Models and Algorithms for Coscheduling Compute-Intensive Tasks on a Network of Workstations , 1992, J. Parallel Distributed Comput..
[82] L. Rudolph,et al. Gang scheduling for highly efficient, distributed multiprocessor systems , 1996, Proceedings of 6th Symposium on the Frontiers of Massively Parallel Computation (Frontiers '96).
[83] BeltramettiMonica,et al. The control mechanism for the Myrias parallel computer system , 1988 .
[84] Michael J. Quinn,et al. Analysis and Implementation of Branch-and Bound Algorithms on a Hypercube Multicomputer , 1990, IEEE Trans. Computers.
[85] David A. Padua,et al. Execution of Parallel Loops on Parallel Processor Systems , 1986, ICPP.
[86] Howard Jay Siegel,et al. Extensions to the C Programming Language for SIMD/MIMD Parallelism , 1985, ICPP.
[87] Satish K. Tripathi,et al. Analysis of Processor Allocation in Multiprogrammed, Distributed-Memory Parallel Processing Systems , 1994, IEEE Trans. Parallel Distributed Syst..
[88] Eli Upfal,et al. Balanced Allocations , 1999, SIAM J. Comput..
[89] W. Kent Fuchs,et al. An Analysis of Cache Performance for a Hypercube Multicomputer , 1992, IEEE Trans. Parallel Distributed Syst..
[90] Kevin P. McAuliffe,et al. The IBM Research Parallel Processor Prototype (RP3): Introduction and Architecture , 1985, ICPP.
[91] John L. Gustafson,et al. A low-cost hypercube load-balance algorithm , 1989 .
[92] G. Jack Lipovski,et al. Parallel computing - theory and comparisons , 1987 .
[93] Edward D. Lazowska,et al. The Effect of Scheduling Discipline on Spin Overhead in Shared Memory Parallel Systems , 1991, IEEE Trans. Parallel Distributed Syst..
[94] Phillip Krueger,et al. The Diverse Objectives of Distributed Scheduling Policies , 1987, ICDCS.
[95] Mark Heuser. An Implementation of Real-Time Thread Synchronization , 1990, USENIX Summer.
[96] Andrea C. Arpaci-Dusseau,et al. The interaction of parallel and sequential workloads on a network of workstations , 1995, SIGMETRICS '95/PERFORMANCE '95.
[97] Per Brinch Hansen. An Analysis of Response Ratio Scheduling , 1971, IFIP Congress.
[98] David J. DeWitt,et al. The Crystal Multicomputer: Design and Implementation Experience , 1987, IEEE Transactions on Software Engineering.
[99] Anoop Gupta,et al. The impact of operating system scheduling policies and synchronization methods of performance of parallel applications , 1991, SIGMETRICS '91.
[100] Dan C. Marinescu,et al. Correlation of the paging activity of individual node programs in the SPMD execution mode , 1995, Proceedings of the Twenty-Eighth Annual Hawaii International Conference on System Sciences.
[101] Michael Metcalf,et al. High performance Fortran , 1995 .
[102] H. T. Kung,et al. The Warp Computer: Architecture, Implementation, and Performance , 1987, IEEE Transactions on Computers.
[103] David J. DeWitt,et al. Parallel database systems: the future of high performance database systems , 1992, CACM.
[104] Wolfgang Schröder-Preikschat,et al. PEACE - A Software Backplane for Parallel Computing , 1994, Parallel Comput..
[105] Steven Hotovy,et al. Workload Evolution on the Cornell Theory Center IBM SP2 , 1996, JSSPP.
[106] Jingwen Wang,et al. Utopia: A load sharing facility for large, heterogeneous distributed computer systems , 1993, Softw. Pract. Exp..
[107] Robbert van Renesse,et al. Experiences with the Amoeba distributed operating system , 1990, CACM.
[108] M. K. Seager,et al. Simulating the scheduling of parallel supercomputer applications , 1989 .
[109] Raj Vaswani,et al. A dynamic processor allocation policy for multiprogrammed shared-memory multiprocessors , 1993, TOCS.
[110] John P. Hayes,et al. Subcube Allocation in Hypercube Computers , 1991, IEEE Trans. Computers.
[111] Robert E. McGrath,et al. The Xylem Operating System , 1991, ICPP.
[112] William E. Weihl,et al. Lottery scheduling: flexible proportional-share resource management , 1994, OSDI '94.
[113] John P. Hayes,et al. A Microprocessor-based Hypercube Supercomputer , 1986, IEEE Micro.
[114] Harry F. Jordan,et al. Report of the Purdue Workshop on Grand Challenges in Computer Architecture for the Support of High Performance Computing , 1992, J. Parallel Distributed Comput..
[115] Tim Brecht,et al. Processor-pool-based scheduling for large-scale NUMA multiprocessors , 1991, SIGMETRICS '91.
[116] Alexander Reinefeld,et al. MARS - A framework for minimizing the job execution time in a metacomputing environment , 1996, Future Gener. Comput. Syst..
[117] Miron Livny,et al. Parallel Processing on Dynamic Resources with CARMI , 1995, JSSPP.
[118] Miron Livny,et al. A worldwide flock of Condors: Load sharing among workstation clusters , 1996, Future Gener. Comput. Syst..
[119] Arnold L. Rosenberg,et al. On trading task reallocation for thread management in partitionable multiprocessors , 1996, SPAA '96.
[120] C. Natarajan,et al. Measurement-based characterization of global memory and network contention, operating system and parallelisation overheads: case study on a shared-memory multiprocessor , 1994, Proceedings of 21 International Symposium on Computer Architecture.
[121] Craig A. Morgenstern,et al. Efficient submesh allocation using interval sets , 1994, 1994 Proceedings of the Twenty-Seventh Hawaii International Conference on System Sciences.
[122] Leonard Kleinrock,et al. Power and deterministic rules of thumb for probabilistic problems in computer communications , 1979 .
[123] Tim Brecht,et al. Using Parallel Program Characteristics in Dynamic Processor Allocation Policies , 1996, Perform. Evaluation.
[124] Inmos Corp,et al. Occam Programming Manual , 1984 .
[125] Hesham El-Rewini,et al. Processor Allocation for Hypercubes , 1992, J. Parallel Distributed Comput..
[126] Alan Weiss,et al. Allocating Independent Subtasks on Parallel Processors , 1985, IEEE Transactions on Software Engineering.
[127] Mark S. Squillante,et al. Analysis of Contention in Multiprocessor Scheduling , 1990, Performance.
[128] Sanjeev Setia. Trace-driven analysis of migration-based gang scheduling policies for parallel computers , 1997, Proceedings of the 1997 International Conference on Parallel Processing (Cat. No.97TB100162).
[129] Maurice Herlihy,et al. Low contention load balancing on large-scale multiprocessors , 1992, SPAA '92.
[130] Forbes J. Burkowski. A vector and array multiprocessor extension of the sylvan architecture , 1984, ISCA '84.
[131] G. A. Geist,et al. The evolution of the PVM concurrent computing system , 1993, Digest of Papers. Compcon Spring.
[132] Thomas L. Casavant,et al. A Taxonomy of Scheduling in General-Purpose Distributed Computing Systems , 1988, IEEE Trans. Software Eng..
[133] Alexander V. Veidenbaum,et al. The Organization of the Cedar System , 1991, ICPP.
[134] Leonard Kleinrock,et al. Collecting unused processing capacity: an analysis of transient distributed systems , 1989, [1989] Proceedings. The 9th International Conference on Distributed Computing Systems.
[135] Michael Hitchens,et al. A new process migration algorithm , 1997, OPSR.
[136] Thu D. Nguyen,et al. Parallel Application Characteristics for Multiprocessor Scheduling Policy Design , 1996, JSSPP.
[137] Mark S. Squillante,et al. Scheduling of Large Scientific Applications on Distributed Memory Multiprocessor Systems , 1993, PPSC.
[138] Kam-Hoi Cheng,et al. A two dimensional buddy system for dynamic resource allocation in a partitionable mesh connected system , 1990, CSC '90.
[139] Jeffrey C. Mogul,et al. The effect of context switches on cache performance , 1991, ASPLOS IV.
[140] Nian-Feng Tzeng,et al. A Fast Recognition-Complete Processor Allocation Strategy for Hypercube Computers , 1992, IEEE Trans. Computers.
[141] Donald F. Towsley,et al. Adaptive Load Sharing in Heterogeneous Distributed Systems , 1990, J. Parallel Distributed Comput..
[142] Chong-Wei Xu,et al. A Distributed Drafting Algorithm for Load Balancing , 1985, IEEE Transactions on Software Engineering.
[143] Paul Watson,et al. The FLAGSHIP parallel machine , 1989 .
[144] Raymond M. Bryant,et al. Operating system support for parallel programming on RP3 , 1991, IBM J. Res. Dev..
[145] Tao Yang,et al. A Comparison of Clustering Heuristics for Scheduling Directed Acycle Graphs on Multiprocessors , 1992, J. Parallel Distributed Comput..
[146] Victor Lee,et al. Implications of I/O for Gang Scheduled Workloads , 1997, JSSPP.
[147] Constantine D. Polychronopoulos. Parallel Programming Issues , 1993, Int. J. High Speed Comput..
[148] John Zahorjan,et al. Scheduling a mixed interactive and batch workload on a parallel, shared memory supercomputer , 1992, Proceedings Supercomputing '92.
[149] H. T. Kung,et al. Supporting systolic and memory communication in iWarp , 1990, ISCA '90.
[150] Bill Nitzberg,et al. A comparison of workload traces from two production parallel machines , 1996, Proceedings of 6th Symposium on the Frontiers of Massively Parallel Computation (Frontiers '96).
[151] Krithi Ramamritham,et al. Distributed Scheduling of Tasks with Deadlines and Resource Requirements , 1989, IEEE Trans. Computers.
[152] Phillip Krueger,et al. A comparison of preemptive and non-preemptive load distributing , 1988, [1988] Proceedings. The 8th International Conference on Distributed.
[153] Craig A. Morgenstern. Methods for Precise Submesh Allocation , 1994, Sci. Program..
[154] Edward D. Lazowska,et al. A Comparison of Receiver-Initiated and Sender-Initiated Adaptive Load Sharing , 1986, Perform. Evaluation.
[155] Henri E. Bal,et al. Panda: a portable platform to support parallel programming languages , 1993 .
[156] Izidor Gertner,et al. On the Complexity of Scheduling Problems for Parallel/Pipelined Machines , 1989, IEEE Trans. Computers.
[157] Thu D. Nguyen,et al. Maximizing speedup through self-tuning of processor allocation , 1996, Proceedings of International Conference on Parallel Processing.
[158] Frank Bellosa,et al. Locality Information Based Scheduling in Shared Memory Multiprocessors , 1996, JSSPP.
[159] Richard Wolski,et al. Time Sharing Massively Parallel Machines , 1995, ICPP.
[160] Gianni Conte,et al. Massively Parallel Processor , 1994 .
[161] Josep Torrellas,et al. Evaluating the Performance of Cache-Affinity Scheduling in Shared-Memory Multiprocessors , 1995, J. Parallel Distributed Comput..
[162] Vipin Kumar,et al. Concurrent Access of Priority Queues , 1988, IEEE Trans. Computers.
[163] William T. C. Kramer,et al. Effective use of Cray supercomputers , 1989, Proceedings of the 1989 ACM/IEEE Conference on Supercomputing (Supercomputing '89).
[164] W. Daniel Hillis,et al. Data parallel algorithms , 1986, CACM.
[165] D. J. Wallace,et al. The Edinburgh Concurrent Supercomputer: project and applications , 1988 .
[166] Tim Brecht,et al. On the importance of parallel application placement in NUMA multiprocessors , 1993 .
[167] Nicholas Carriero,et al. Adaptive Parallelism on Multiprocessors: Preliminary Experience with Piranha on the CM-5 , 1993, LCPC.
[168] Robert M. Keller,et al. A loosely-coupled applicative multi-processing system* , 1979, 1979 International Workshop on Managing Requirements Knowledge (MARK).
[169] Brian N. Bershad,et al. PRESTO: A system for object‐oriented parallel programming , 1988, Softw. Pract. Exp..
[170] Kang G. Shin,et al. HARTOS: a distributed real-time operating system , 1989, OPSR.
[171] Kang G. Shin,et al. Load Sharing in Distributed Real-Time Systems with State-Change Broadcasts , 1989, IEEE Trans. Computers.
[172] B. Clifford Neuman,et al. The Prospero Resource Manager: A scalable framework for processor allocation in distributed systems , 1994, Concurr. Pract. Exp..
[173] Kenneth C. Sevcik,et al. Application Scheduling and Processor Allocation in Multiprogrammed Parallel Processing Systems , 1994, Perform. Evaluation.
[174] B J Smith,et al. A pipelined, shared resource MIMD computer , 1986 .
[175] Geoffrey C. Fox,et al. Hierarchical Scheduling of Dynamic Parallel Computaion on Hypercube Multicomputers , 1994, J. Parallel Distributed Comput..
[176] Brian N. Bershad,et al. The interaction of architecture and operating system design , 1991, ASPLOS IV.
[177] Ramesh Krishnamurti. An Approximation Algorithm for Scheduling Tasks on Varying Partition Sizes in Partitionable Multiprocessor Systems , 1992, IEEE Trans. Computers.
[178] Robbert van Renesse,et al. Amoeba A Distributed Operating System for the 1990 s Sape , 1990 .
[179] Keqin Li,et al. Job Scheduling in a Partitionable Mesh Using a Two-Dimensional Buddy System Partitioning Scheme , 1991, IEEE Trans. Parallel Distributed Syst..
[180] Paul Messina. The concurrent supercomputing consortium: Year 1 , 1993, IEEE Parallel & Distributed Technology: Systems & Applications.
[181] William J. Dally,et al. Performance Analysis of k-Ary n-Cube Interconnection Networks , 1987, IEEE Trans. Computers.
[182] Brian N. Bershad,et al. Using continuations to implement thread management and communication in operating systems , 1991, SOSP '91.
[183] Clark D. Thomborson,et al. Does your workstation computation belong on a vector supercomputer? , 1993, CACM.
[184] Janak H. Patel,et al. NETRA: A Hierarchical and Partitionable Architecture for Computer Vision Systems , 1993, IEEE Trans. Parallel Distributed Syst..
[185] Miron Livny,et al. Interfacing Condor and PVM to harness the cycles of workstation clusters , 1996, Future Gener. Comput. Syst..
[186] Monica S. Lam,et al. The cache performance and optimizations of blocked algorithms , 1991, ASPLOS IV.
[187] Joseph L. Hellerstein,et al. Achieving Service Rate Objectives with Decay Usage Scheduling , 1993, IEEE Trans. Software Eng..
[188] Anoop Gupta,et al. Process control and scheduling issues for multiprogrammed shared-memory multiprocessors , 1989, SOSP '89.
[189] Yahui Zhu,et al. Efficient Processor Allocation Strategie for Mesh-Connected Parallel Computers , 1992, J. Parallel Distributed Comput..
[190] Larry Rudolph,et al. Towards Convergence in Job Schedulers for Parallel Supercomputers , 1996, JSSPP.
[191] Howard Jay Siegel,et al. Interconnection networks for large-scale parallel processing: theory and case studies (2nd ed.) , 1985 .
[192] Qing Yang,et al. A New Graph Approach to Minimizing Processor Fragmentation in Hypercube Multiprocessors , 1993, IEEE Trans. Parallel Distributed Syst..
[193] Kurt Kremer,et al. Scheduling a metacomputer by an implicit voting system , 1994, Proceedings of 3rd IEEE International Symposium on High Performance Distributed Computing.
[194] .. G. Plaxton. Load Balancing , Selection and Sorting on the HypercubeC , 1989 .
[195] Josep Torrellas,et al. Characterizing the caching and synchronization performance of a multiprocessor operating system , 1992, ASPLOS V.
[196] Yonatan Aumann,et al. Clock Construction in Fully Asynchronous Parallel Systems and PRAM Simulation , 1994, Theor. Comput. Sci..
[197] R Calkin,et al. Portable Programming with the PARMACS Message-Passing Library , 1994, Parallel Comput..
[198] David L. Black. Processors, Priority, and Policy: Mach Scheduling for New Environments , 1991, USENIX Winter.
[199] David L. Black,et al. Locking and Reference Counting in the Mach Kernel , 1991, ICPP.
[200] Charles Koelbel,et al. Supporting shared data structures on distributed memory architectures , 1990, PPOPP '90.
[201] Phillip Krueger,et al. Processor allocation vs. job scheduling on hypercube computers , 1991, [1991] Proceedings. 11th International Conference on Distributed Computing Systems.
[202] Yutaka Ishikawa,et al. A scalable time-sharing scheduling for partitionable distributed memory parallel machines , 1995, Proceedings of the Twenty-Eighth Annual Hawaii International Conference on System Sciences.
[203] D. W. Duke,et al. Research toward a heterogeneous networked computing cluster , 1998 .
[204] Phillip Krueger,et al. The Effects of Precedence and Priority Constraints on the Performance of Scan Scheduling for Hypercube Multiprocessors , 1996, J. Parallel Distributed Comput..
[205] Peter M. A. Sloot,et al. A dynamic load balancing system for parallel cluster computing , 1996, Future Gener. Comput. Syst..
[206] Kenneth C. Sevcik,et al. Multiprocessor Scheduling for High-Variability Service Time Distributions , 1995, JSSPP.
[207] Jacek Blazewicz,et al. Scheduling Multiprocessor Tasks to Minimize Schedule Length , 1986, IEEE Transactions on Computers.
[208] Robert M. Keller,et al. Simulated Performance of a Reduction-Based Multiprocessor , 1984, Computer.
[209] Evangelos P. Markatos,et al. Multiprogramming on multiprocessors , 1991, Proceedings of the Third IEEE Symposium on Parallel and Distributed Processing.
[210] M. Takamura,et al. Overview of the Fujitsu VPP500 supercomputer , 1993, Digest of Papers. Compcon Spring.
[211] D J Kuck,et al. Parallel Supercomputing Today and the Cedar Approach , 1986, Science.
[212] B. Duzett,et al. An overview of the nCUBE 3 supercomputer , 1992, [Proceedings 1992] The Fourth Symposium on the Frontiers of Massively Parallel Computation.
[213] Ed Zaluska,et al. Parallel Load-Balancing: An Extension to the Gradient Model , 1995, Parallel Comput..
[214] W. Schröder,et al. The distributed PEACE operating system and its suitability for MIMD message-passing architectures , 1989 .
[215] Anoop Gupta,et al. Scaling parallel programs for multiprocessors: methodology and examples , 1993, Computer.
[216] Robert M. Keller,et al. The Gradient Model Load Balancing Method , 1987, IEEE Transactions on Software Engineering.
[217] Donald F. Ferguson,et al. Microeconomic algorithms for load balancing in distributed computer systems , 1988, [1988] Proceedings. The 8th International Conference on Distributed.
[218] Bettina Schnor. Dynamic Scheduling of Parallel Applications , 1995, PaCT.
[219] Marios C. Papaefthymiou,et al. Stochastic Analysis of Gang Scheduling in Parallel and Distributed Systems , 1996, Perform. Evaluation.
[220] Phil Hontalas,et al. Distributed Simulation and the Time Wrap Operating System. , 1987, SOSP 1987.
[221] Larry D. Wittie,et al. Wave Scheduling - Decentralized Scheduling of Task Forces in Multicomputers , 1984, IEEE Trans. Computers.
[222] Mark D. Hill,et al. A Unified Formalization of Four Shared-Memory Models , 1993, IEEE Trans. Parallel Distributed Syst..
[223] Masayuki Ikeda,et al. Architecture of the VPP500 parallel supercomputer , 1994, Proceedings of Supercomputing '94.
[224] Francis C. M. Lau,et al. An analytical comparison of nearest neighbor algorithms for load balancing in parallel computers , 1995, Proceedings of 9th International Parallel Processing Symposium.
[225] Wesley W. Chu,et al. Task Allocation in Distributed Data Processing , 1980, Computer.
[226] Dhiraj K. Pradhan,et al. A novel approach for subcube allocation in hypercube multiprocessors , 1992, [1992] Proceedings of the Fourth IEEE Symposium on Parallel and Distributed Processing.
[227] Jacques E. Boillat,et al. Load Balancing and Poisson Equation in a Graph , 1990, Concurr. Pract. Exp..
[228] Nicholas Carriero,et al. How to write parallel programs: a guide to the perplexed , 1989, CSUR.
[229] Janusz S. Kowalik,et al. Parallel MIMD computation : the HEP supercomputer and its applications , 1985 .
[230] Jitender S. Deogun,et al. Inherently stable real-time priority list dispatchers , 1994, IEEE Parallel & Distributed Technology: Systems & Applications.
[231] Dennis G. Shea,et al. The SP2 High-Performance Switch , 1995, IBM Syst. J..
[232] Vivek Sarkar,et al. Partitioning and Scheduling Parallel Programs for Multiprocessing , 1989 .
[233] William J. Dally,et al. Universal Mechanisms for Concurrency , 1989, PARLE.
[234] Tom Jones. Engineering design of the Convex C2 , 1989, Computer.
[235] Dror G. Feitelson,et al. A run-time algorithm for managing the granularity of parallel functional programs , 1992, Journal of Functional Programming.
[236] Jehoshua Bruck,et al. The IBM External User Interface for Scalable Parallel Systems , 1994, Parallel Comput..
[237] L. W. Tucker,et al. Architecture and applications of the Connection Machine , 1988, Computer.
[238] Thomas Kunz,et al. The Influence of Different Workload Descriptions on a Heuristic Load Balancing Scheme , 1991, IEEE Trans. Software Eng..
[239] Lawrence W. Dowdy,et al. Static Processor Allocation in a Soft Real-Time Multiprocessor Environment , 1994, IEEE Trans. Parallel Distributed Syst..
[240] Brian N. Bershad,et al. Scheduler activations: effective kernel support for the user-level management of parallelism , 1991, TOCS.
[241] Prithviraj Banerjee,et al. Performance measurement and trace driven simulation of parallel CAD and numeric applications on a hypercube multicomputer , 1990, ISCA '90.
[242] Gregory R. Andrews,et al. Distributed filaments: efficient fine-grain parallelism on a cluster of workstations , 1994, OSDI '94.
[243] Mark S. Squillante,et al. Analysis of the Impact of Memory in Distributed Parallel Processing Systems , 1994, SIGMETRICS.
[244] David S. Johnson,et al. Approximation Algorithms for Bin-Packing — An Updated Survey , 1984 .
[245] Shreekant S. Thakkar,et al. Performance of an OLTP application on symmetry multiprocessor system , 1990, ISCA '90.
[246] Robert H. Halstead,et al. MULTILISP: a language for concurrent symbolic computation , 1985, TOPL.
[247] Kyu Ho Park,et al. A Link-Disjoint Subcube for Processor Allocation in Hypercube Computers , 1997, Parallel Comput..
[248] Yung-Terng Wang,et al. Load Sharing in Distributed Systems , 1985, IEEE Transactions on Computers.
[249] Ravishankar K. Iyer,et al. Predictability of Process Resource Usage: A Measurement-Based Study on UNIX , 1989, IEEE Trans. Software Eng..
[250] Patrick Sobalvarro,et al. Demand-Based Coscheduling of Parallel Jobs on Multiprogrammed Multiprocessors , 1995, JSSPP.
[251] Charles L. Seitz,et al. Multicomputers: message-passing concurrent computers , 1988, Computer.
[252] David S. Johnson,et al. The NP-Completeness Column: An Ongoing Guide , 1982, J. Algorithms.
[253] David Gelernter,et al. Supercomputing out of recycled garbage: preliminary experience with Piranha , 1992, ICS '92.
[254] Philip S. Yu,et al. Approximate algorithms scheduling parallelizable tasks , 1992, SPAA '92.
[255] Evangelos P. Markatos,et al. First-class user-level threads , 1991, SOSP '91.
[256] Bradley C. Kuszmaul,et al. Cilk: an efficient multithreaded runtime system , 1995, PPOPP '95.
[257] Kwan Woo Ryu,et al. Efficient Algorithms for List Ranking and for Solving Graph Problems on the Hypercube , 1990, IEEE Trans. Parallel Distributed Syst..
[258] Seyed Hossein Hosseini,et al. A methodology for evaluating load balancing algorithms , 1993, [1993] Proceedings The 2nd International Symposium on High Performance Distributed Computing.
[259] Kenneth C. Sevcik. Characterizations of parallelism in applications and their use in scheduling , 1989, SIGMETRICS '89.
[260] Donald Yeung,et al. Sparcle: an evolutionary processor design for large-scale multiprocessors , 1993, IEEE Micro.
[261] Hussein M. Abdel-Wahab,et al. A Microeconomic Scheduler for Parallel Computers , 1995, JSSPP.
[262] John Zahorjan,et al. Scheduling memory constrained jobs on distributed memory parallel computers , 1995, SIGMETRICS '95/PERFORMANCE '95.
[263] Edith Schonberg,et al. Factoring: a method for scheduling parallel loops , 1992 .
[264] John Zahorjan,et al. Processor scheduling in shared memory multiprocessors , 1990, SIGMETRICS '90.
[265] Howard Jay Siegel. Interconnection Network for Large-Scale Parallel Processing , 1990 .
[266] Mark S. Squillante,et al. Dynamic Partitioning in Different Distributed-Memory Environments , 1996, JSSPP.
[267] Randall W. Dean. Using Continuations to Build a User-Level Threads Library , 1993, USENIX MACH Symposium.
[268] C. H. Russell,et al. Variations on UNIX for parallel-processing computers , 1987, CACM.
[269] David R. Cheriton,et al. Application-controlled physical memory using external page-cache management , 1992, ASPLOS V.
[270] Chita R. Das,et al. Limit Allocation: An Efficient Processor Management Scheme for Hypercubes , 1994, 1994 Internatonal Conference on Parallel Processing Vol. 2.
[271] David L. Black. Scheduling support for concurrency and parallelism in the Mach operating system , 1990, Computer.
[272] Shikharesh Majumdar,et al. Scheduling in multiprogrammed parallel systems , 1988, SIGMETRICS '88.
[273] Jeanette P. Schmidt,et al. Load-sharing in heterogeneous systems via weighted factoring , 1996, SPAA '96.
[274] G. D. Burns,et al. Trillium operating system , 1988, C3P.
[275] Howard Jay Siegel,et al. Task Scheduling on the PASM Parallel Processing System , 1985, IEEE Transactions on Software Engineering.
[276] Donald F. Towsley,et al. Analysis of the Effects of Delays on Load Sharing , 1989, IEEE Trans. Computers.
[277] Kai Hwang,et al. Supercomputers - Design and Applications , 1984 .
[278] Manoj Kumar,et al. Measuring Parallelism in Computation-Intensive Scientific/Engineering Applications , 1988, IEEE Trans. Computers.
[279] Wenjian Qiao,et al. Eecient Processor Allocation for 3d Tori , 1994 .
[280] Larry Rudolph,et al. Issues Related to MIMD Shared-memory Computers: The NYU Ultracomputer Approach , 1985, ISCA.
[281] Carla Schlatter Ellis,et al. The robustness of NUMA memory management , 1991, SOSP '91.
[282] Dror G. Feitelson,et al. Improved Utilization and Responsiveness with Gang Scheduling , 1997, JSSPP.
[283] David J. Lilja,et al. Efficient execution of parallel applications in multiprogrammed multiprocessor systems , 1996, Proceedings of International Conference on Parallel Processing.
[284] Dhiraj K. Pradhan,et al. Job Scheduling in Mesh Multicomputers , 1994, 1994 Internatonal Conference on Parallel Processing Vol. 2.
[285] Eli Upfal,et al. A Probabilistic Approach to the Load-Sharing Problem in Distributed Systems , 1987, J. Parallel Distributed Comput..
[286] Rupak Biswas,et al. A dynamic load balancing framework for unstructured adaptive computations on distributed-memory multiprocessors , 1996, SPAA '96.
[287] Ten-Hwang Lai,et al. Constructing Parallel Paths Betweesn Two Subcubes , 1992, IEEE Trans. Computers.
[288] Wei-Tek Tsai,et al. Lookahead processor allocation in mesh-connected massively parallel multicomputer , 1994, Proceedings of 8th International Parallel Processing Symposium.
[289] Lawrence W. Dowdy,et al. Dynamic partitioning in a transputer environment , 1990, SIGMETRICS '90.
[290] Murthy V. Devarakonda,et al. Issues in implementation of cache-affinity scheduling , 1992 .
[291] Laxmikant V. Kalé,et al. Supporting Machine Independent Programming on Diverse Parallel Architectures , 1991, ICPP.
[292] Brent Gorda,et al. Gang scheduling a parallel machine , 1991 .
[293] Bill Nitzberg,et al. Non-contiguous processor allocation algorithms for distributed memory multicomputers , 1994, Proceedings of Supercomputing '94.
[294] CORPORATE Ncube. The NCUBE family of high-performance parallel computer systems , 1988, C3P.
[295] Nawaf Bitar,et al. A Scalable Multi-Discipline, Multiple-Processor Scheduling Framework for IRIX , 1995, JSSPP.
[296] Andrea C. Arpaci-Dusseau,et al. Effective distributed scheduling of parallel workloads , 1996, SIGMETRICS '96.
[297] Larry Rudolph,et al. Gang Scheduling Performance Benefits for Fine-Grain Synchronization , 1992, J. Parallel Distributed Comput..
[298] Greg Wilson,et al. "Past, Present, Parallel": A Survey Of Available Parallel Computer Systems , 1991 .
[299] Abraham Silberschatz,et al. Operating System Concepts , 1983 .
[300] Jeff Magee,et al. Scalable, adaptive load sharing for distributed systems , 1993, IEEE Parallel & Distributed Technology: Systems & Applications.
[301] Edward D. Lazowska,et al. Adaptive load sharing in homogeneous distributed systems , 1986, IEEE Transactions on Software Engineering.
[302] Phillip Krueger,et al. Adaptive Location Policies for Global Scheduling , 1994, IEEE Trans. Software Eng..
[303] Ray Bryant,et al. Experience Developing the RP3 Operating System , 1991, Comput. Syst..
[304] Sajal K. Das,et al. Optimal and Load Balanced Mapping of Parallel Priority Queues in Hypercubes , 1996, IEEE Trans. Parallel Distributed Syst..
[305] Miron Livny,et al. Condor-a hunter of idle workstations , 1988, [1988] Proceedings. The 8th International Conference on Distributed.
[306] Henry M. Levy,et al. The performance of an object-oriented threads package , 1990, OOPSLA/ECOOP '90.
[307] Chita R. Das,et al. A Lazy Scheduling Scheme for Hypercube Computers , 1995, J. Parallel Distributed Comput..
[308] Thomas E. Anderson,et al. The Performance of Spin Lock Alternatives for Shared-Memory Multiprocessors , 1990, IEEE Trans. Parallel Distributed Syst..
[309] R. E. Kessler,et al. Cray T3D: a new dimension for Cray Research , 1993, Digest of Papers. Compcon Spring.
[310] Shuichi Sakai,et al. Time Space Sharing Scheduling and Architectural Support , 1995, JSSPP.
[311] J. Rothnie,et al. The KSR 1: bridging the gap between shared memory and MPPs , 1993, Digest of Papers. Compcon Spring.
[312] Dror G. Feitelson,et al. Parallel File Systems for the IBM SP Computers , 1995, IBM Syst. J..
[313] Howard Jay Siegel,et al. A Distributed Management Scheme for Partitionable Parallel Computers , 1990, IEEE Trans. Parallel Distributed Syst..
[314] Kenneth C. Sevcik,et al. Implementing Multiprocessor Scheduling Disciplines , 1997, JSSPP.
[315] H. T. Kung. Deadlock avoidance for systolic communication , 1988, ISCA '88.
[316] Samuel T. Chanson,et al. Distributed, object-based programming systems , 1991, CSUR.
[317] Kam-Hoi Cheng,et al. A Heuristic of Scheduling Parallel Tasks and its Analysis , 1992, SIAM J. Comput..
[318] G. N. Srinivasa Prasanna,et al. Hierarchical Compilation of Macro Dataflow Graphs for Multiprocessors with Local Memory , 1994, IEEE Trans. Parallel Distributed Syst..
[319] Constantine D. Polychronopoulos,et al. Processor Allocation for Horizontal and Vertical Parallelism and Related Speedup Bounds , 1987, IEEE Transactions on Computers.
[320] Mark S. Squillante,et al. Using Processor-Cache Affinity Information in Shared-Memory Multiprocessor Scheduling , 1993, IEEE Trans. Parallel Distributed Syst..
[321] Carla Schlatter Ellis,et al. OS Experimentation and a User Community Coexist Under the DUnX Kernel , 1991, ICPP.
[322] Ming-Syan Chen,et al. Subcube Allocation and Task Migration in Hypercube Multiprocessors , 1990, IEEE Trans. Computers.
[323] Jan L. Guynes. Impact of system response time on state anxiety , 1988, CACM.
[324] Phillip Krueger,et al. On-Line Hard Real-Time Scheduling of Parallel Tasks on Partitionable Multiprocessors , 1994, 1994 Internatonal Conference on Parallel Processing Vol. 2.
[325] Shreekant S. Thakkar,et al. Synchronization algorithms for shared-memory multiprocessors , 1990, Computer.
[326] Kenneth C. Sevcik,et al. Coordinated allocation of memory and processors in multiprocessors , 1996, SIGMETRICS '96.
[327] Dipak Ghosal,et al. Processor Scheduling in Multiprocessor Systems , 1991, ACPC.
[328] J. Flower,et al. Moose: a multi-tasking operating system of hypercubes , 1988, C3P.
[329] R. Arlauskas. iPSC/2 system: a second generation hypercube , 1988, C3P.
[330] Robert E. Tarjan,et al. Performance Bounds for Level-Oriented Two-Dimensional Packing Algorithms , 1980, SIAM J. Comput..
[331] Shlomo Nir,et al. NATO ASI Series , 1995 .
[332] Willem G. Vree,et al. Distributed hierarchical scheduling with explicit grain size control , 1992, Future Gener. Comput. Syst..
[333] Amnon Barak,et al. A distributed load‐balancing policy for a multicomputer , 1985, Softw. Pract. Exp..
[334] Susan R. Dickey,et al. Hardware combining and scalability , 1992, SPAA '92.
[335] Yutaka Ishikawa,et al. Implementation of Gang-Scheduling on Workstation Cluster , 1996, JSSPP.
[336] Virginia Mary Lo,et al. Heuristic Algorithms for Task Assignment in Distributed Systems , 1988, IEEE Trans. Computers.
[337] Robert Olson. Parallel Processing in a Message-Based operating System , 1985, IEEE Software.
[338] C. M. Pancake. Multithreaded languages for scientific and technical computing , 1993 .
[339] Graham Birtwistle,et al. Vlsi and Parallel Computation , 1990 .
[340] Ishfaq Ahmad,et al. Editorial: Resource management of parallel and distributed systems with static scheduling: Challenges, solutions and new problems , 1995, Concurr. Pract. Exp..
[341] Richard M. Karp,et al. Parallel Algorithms for Shared-Memory Machines , 1991, Handbook of Theoretical Computer Science, Volume A: Algorithms and Complexity.
[342] Michael L. Scott,et al. Design Rationale for Psyche a General-Purpose Multiprocessor Operating System , 1988, ICPP.
[343] John K. Ousterhout,et al. Medusa: An experiment in distributed operating system structure (Summary) , 1979, SOSP '79.
[344] F. Ferstl. Job- and resource-management systems in heterogeneous clusters , 1996, Future Gener. Comput. Syst..
[345] Raphael A. Finkel,et al. A Stable Distributed Scheduling Algorithm , 1981, IEEE International Conference on Distributed Computing Systems.
[346] Robert H. Halstead,et al. Mul-T: a high-performance parallel Lisp , 1989, PLDI '89.
[347] Keshav Pingali,et al. Access normalization: loop restructuring for NUMA compilers , 1992, ASPLOS V.
[348] David Gelernter,et al. Generative communication in Linda , 1985, TOPL.
[349] John K. Ousterhout,et al. Scheduling Techniques for Concurrent Systems , 1982, ICDCS.
[350] Ken Kennedy,et al. Performance of parallel processors , 1989, Parallel Comput..
[351] Sartaj Sahni,et al. Anomalies in Parallel Branch-and-Bound Algorithms , 1984 .
[352] P. Pierce,et al. The NX/2 operating system , 1988, C3P.
[353] Dejan S. Milojicic,et al. Operating system support for concurrent remote task creation , 1995, Proceedings of 9th International Parallel Processing Symposium.
[354] Edward D. Lazowska,et al. The limited performance benefits of migrating active processes for load sharing , 1988, SIGMETRICS '88.
[355] Jörn Gehring,et al. Architecture-Independent Request-Scheduling with Tight Waiting-Time Estimations , 1996, JSSPP.
[356] Dennis Gannon,et al. The characteristics of parallel algorithms , 1987 .
[357] Matt W. Mutka,et al. A Model for Analyzing Interactions in 2-D Mesh Wormhole-Routed Multicomputers , 1996, Parallel Comput..
[358] K. G. Shin,et al. Task migration in hypercube multiprocessors , 1989, ISCA '89.
[359] Joel H. Saltz,et al. Dynamic Remapping of Parallel Computations with Varying Resource Demands , 1988, IEEE Trans. Computers.
[360] Jeffrey D. Ullman,et al. NP-Complete Scheduling Problems , 1975, J. Comput. Syst. Sci..
[361] Philip J. Hatcher,et al. Data-Parallel Programming on MIMD Computers , 1991, IEEE Trans. Parallel Distributed Syst..
[362] Allen B. Downey,et al. Using Queue Time Predictions for Processor Allocation , 1997, JSSPP.
[363] Kurt Kremer,et al. A Distributed Computing Center Software for the Efficient Use of Parallel Computer Systems , 1994, HPCN.
[364] Andrew S. Grimshaw,et al. Metasystems: An Approach Combining Parallel Processing and Heterogeneous Distributed Computing Systems , 1994, J. Parallel Distributed Comput..
[365] Dennis G. Shea,et al. E-Kernel: An Embedding Kernel on the IBM Victor V256 Multiprocessor for Program Mapping and Network Reconfiguration , 1994, IEEE Trans. Parallel Distributed Syst..
[366] Roy D. Williams,et al. Performance of dynamic load balancing algorithms for unstructured mesh calculations , 1991, Concurr. Pract. Exp..
[367] Michael Stumm,et al. Hector: a hierarchically structured shared-memory multiprocessor , 1991, Computer.
[368] Francis C. M. Lau,et al. Optimal Parameters for Load Balancing Using the Diffusion Method in k-Ary n-Cube Networks , 1993, Inf. Process. Lett..
[369] Mark S. Squillante,et al. On the Benefits and Limitations of Dynamic Partitioning in Parallel Computer Systems , 1995, JSSPP.
[370] 原田 秀逸. 私の computer 環境 , 1998 .
[371] Donald Yeung,et al. THE MIT ALEWIFE MACHINE: A LARGE-SCALE DISTRIBUTED-MEMORY MULTIPROCESSOR , 1991 .
[372] Yahui Zhu,et al. On Job Scheduling on a Hypercube , 1993, IEEE Trans. Parallel Distributed Syst..
[373] Sivarama P. Dandamudi,et al. A Hierarchical Task Queue Organization for Shared-Memory Multiprocessor Systems , 1995, IEEE Trans. Parallel Distributed Syst..
[374] Gheith A. Abandah,et al. Modeling the communication performance of the IBM SP2 , 1996, Proceedings of International Conference on Parallel Processing.
[375] Quentin F. Stout,et al. Mapping vision algorithms to parallel architectures , 1988, Proc. IEEE.
[376] Vivek Sarkar,et al. Determining average program execution times and their variance , 1989, PLDI '89.
[377] Kemal Efe,et al. Optimal Scheduling of Compute-Intensive Tasks on a Network of Workstations , 1995, IEEE Trans. Parallel Distributed Syst..
[378] Arif Ghafoor,et al. A distributed heterogeneous supercomputing management system , 1993, Computer.
[379] Anoop Gupta,et al. COOL: An object-based language for parallel programming , 1994, Computer.
[380] Eugene H. Spafford,et al. Support for Implementing Scheduling Algorithms Using MESSIAHS , 1994, Sci. Program..
[381] Sartaj Sahni. Scheduling Master-Slave Multiprocessor Systems , 1995, Euro-Par.
[382] Anoop Gupta,et al. Competitive management of distributed shared memory , 1989, Digest of Papers. COMPCON Spring 89. Thirty-Fourth IEEE Computer Society International Conference: Intellectual Leverage.
[383] Joseph Y.-T. Leung,et al. Complexity of Scheduling Parallel Task Systems , 1989, SIAM J. Discret. Math..
[384] Fred Hemery,et al. An analysis of communication and multiprogramming in the Helios operating system , 1991 .
[385] Zarka Cvetanovic,et al. The Effects of Problem Partitioning, Allocation, and Granularity on the Performance of Multiple-Processor Systems , 1987, IEEE Transactions on Computers.
[386] Nian-Feng Tzeng,et al. Allocating Precise Submeshes in Mesh Connected Systems , 1994, IEEE Trans. Parallel Distributed Syst..
[387] Multiprocessors. Using Processor A � nity in Loop Scheduling on Shared Memory , 1994 .
[388] A. Hori. Time Space Sharing Scheduling and Architectural Support, Job Scheduling Strategies for Parallel Processing , 1995 .
[389] Robert L. Henderson,et al. Job Scheduling Under the Portable Batch System , 1995, JSSPP.
[390] Howard Jay Siegel,et al. Using the multistage cube network topology in parallel supercomputers , 1989 .
[391] Ming-Syan Chen,et al. Processor Allocation in an N-Cube Multiprocessor Using Gray Codes , 1987, IEEE Transactions on Computers.
[392] Seung Ryoul Maeng,et al. A heuristic processor allocation strategy in hypercube systems , 1991, Proceedings of the Third IEEE Symposium on Parallel and Distributed Processing.
[393] Peter Steiner,et al. Extending multiprogramming to a DMPP , 1992, Future Gener. Comput. Syst..
[394] Allan Porterfield,et al. The Tera computer system , 1990, ICS '90.
[395] Renaud C. Regis,et al. Multiserver Queueing Models of Multiprocessing Systems , 1973, IEEE Transactions on Computers.
[396] Anthony P. Reeves,et al. Parallel pascal: An extended pascal for parallel computers , 1984, J. Parallel Distributed Comput..
[397] Howard Jay Siegel,et al. Task Preloading Schemes for Reconfigurable Parallel Processing Systems , 1984, IEEE Transactions on Computers.
[398] Erik Tärnvik. Dynamo - a portable tool for dynamic load balancing on distributed memory multicomputers , 1994, Concurr. Pract. Exp..
[399] Robert H. Thomas,et al. The Uniform System: An approach to runtime support for large scale shared memory parallel processors , 1988, ICPP.
[400] S. T. Leutenegger,et al. Distributed computing feasibility in a non-dedicated homogeneous distributed system , 1993, Supercomputing '93.
[401] Sanjay Sharma,et al. Impact of Loop Granularity and Self-Preemption on the Performance of Loop Parallel Applications on a Multiprogrammed Shared-Memory Multiprocessor , 1994, 1994 Internatonal Conference on Parallel Processing Vol. 2.
[402] Ronald H. Perrott,et al. The programming language ACTUS , 1983, Softw. Pract. Exp..
[403] Mukesh Singhal,et al. Load distributing for locally distributed systems , 1992, Computer.
[404] Thomas E. Anderson,et al. The performance implications of thread management alternatives for shared-memory multiprocessors , 1989, SIGMETRICS '89.
[405] Tim Brecht,et al. An Experimental Evaluation of Processor Pool-Based Scheduling for Shared-Memory NUMA Multiprocessors , 1997, JSSPP.
[406] Allan Gottlieb,et al. Process coordination with fetch-and-increment , 1991, ASPLOS IV.
[407] Mihalis Yannakakis,et al. Towards an architecture-independent analysis of parallel algorithms , 1990, STOC '88.
[408] Xiaotie Deng,et al. On Multiprocessor System Scheduling , 1996, SPAA '96.
[409] Michael Hobbs,et al. Performance comparison of process migration with remote process creation mechanisms in RHODOS , 1996, Proceedings of 16th International Conference on Distributed Computing Systems.
[410] Judy Kay,et al. A fair share scheduler , 1988, CACM.
[411] Dirk Grunwald,et al. Empirical Comparison of Heuristic Load Distribution in Point-to-Point Multicomputer Networks , 1990, Proceedings of the Fifth Distributed Memory Computing Conference, 1990..
[412] T. Horie,et al. AP1000 software environment for parallel programming , 1993 .
[413] Ross A. Gagliano,et al. Auction allocation of computing resources , 1995, CACM.
[414] ZahorjanJohn,et al. A dynamic processor allocation policy for multiprogrammed shared-memory multiprocessors , 1993 .
[415] Shikharesh Majumdar,et al. Characterisation of Programs for Scheduling in Multiprogrammed Parallel Systems , 1991, Perform. Evaluation.
[416] Paul Watson,et al. Flagship: a parallel architecture for declarative programming , 1988, [1988] The 15th Annual International Symposium on Computer Architecture. Conference Proceedings.
[417] Rolf Riesen,et al. PUMA: an operating system for massively parallel systems , 1994, 1994 Proceedings of the Twenty-Seventh Hawaii International Conference on System Sciences.
[418] Thomas L. Sterling,et al. Efficient Dynamic Scheduling of Medium-Grained Tasks for General Purpose Parallel Processing , 1988, ICPP.
[419] Guy L. Steele,et al. Compiling Fortran 8x array features for the connection machine computer system , 1988, PPEALS '88.
[420] Dhiraj K. Pradhan,et al. Submesh Allocation in Mesh Multicomputers Using Busy-List: A BestFit Approach with Complete Recognition Capability , 1996, J. Parallel Distributed Comput..
[421] Sanjeev Setia,et al. The Interaction between Memory Allocation and Adaptive Partitioning in Message-Passing Multicomputers , 1995, JSSPP.
[422] Ravishankar K. Iyer,et al. Performance degradation due to multiprogramming and system overheads in real workloads: case study on a shared memory multiprocessor , 1990, ICS '90.
[423] Manoj Kumar,et al. The GF11 parallel computer: Programming and performance , 1992, Future Gener. Comput. Syst..
[424] William J. Dally,et al. Network and processor architecture for message-driven computers , 1990 .
[425] Michael G. Norman,et al. Models of machines and computation for mapping in multicomputers , 1993, CSUR.
[426] Michael J. Flynn,et al. Very high-speed computing systems , 1966 .
[427] Evangelos P. Markatos,et al. Load Balancing vs. Locality Management in Shared-Memory Multiprocessors , 1992, ICPP.
[428] Larry Press,et al. Before the Altair: the history of personal computing , 1993, CACM.
[429] Patrick H. Worley,et al. The Effect of Time Constraints on Scaled Speedup , 1990, SIAM J. Sci. Comput..
[430] Gregory F. Pfister,et al. “Hot spot” contention and combining in multistage interconnection networks , 1985, IEEE Transactions on Computers.
[431] Larry Rudolph,et al. Issues in run-time support for tightly-coupled parallel processing , 1992 .
[432] H.F. Jordan,et al. Experience with pipelined multiple instruction streams , 1984, Proceedings of the IEEE.
[433] CONSTANTINE D. POLYCHRONOPOULOS,et al. Guided Self-Scheduling: A Practical Scheduling Scheme for Parallel Supercomputers , 1987, IEEE Transactions on Computers.
[434] A. Gottleib,et al. The nyu ultracomputer- designing a mimd shared memory parallel computer , 1983 .
[435] Matt W. Mutka,et al. Effects of Job Size Irregularity on the Dynamic Resource Scheduling of a 2-D Mesh Multicomputer , 1993, PARLE.
[436] Sivarama P. Dandamudi. Reducing Run Queue Contention in Shared Memory Multiprocessors , 1997, Computer.
[437] Michael L. Scott,et al. Synchronization without contention , 1991, ASPLOS IV.
[438] John Sanguinetti,et al. Performance of a Message-Based Multiprocessor , 1985, Computer.
[439] Ken Thompson,et al. Plan 9 from Bell Labs , 1995 .
[440] Butler,et al. Hadron mass predictions of the valence approximation to lattice QCD. , 1993, Physical review letters.
[441] David J. Lilja,et al. Loop-Level Process Control: An Effective Processor Allocation Policy for Multiprogrammed Shared-Memory Multiprocessors , 1995, JSSPP.
[442] Avadis Tevanian,et al. MACH threads and the UNIX kernel : the battle for control , 1987 .
[443] Shahid H. Bokhari,et al. On the Mapping Problem , 1981, IEEE Transactions on Computers.
[444] Daniel A. Reed. The Performance of Multimicrocomputer Networks Supporting Dynamic Workloads , 1984, IEEE Transactions on Computers.
[445] Derek L. Eager. Aanity Scheduling of Unbalanced Workloads , 1994 .
[446] Zhiyuan Li,et al. An Empirical Study of the Workload Distribution under Static Scheduling , 1994, 1994 Internatonal Conference on Parallel Processing Vol. 2.
[447] Dharma P. Agrawal,et al. Computational models and resource allocation for supercomputers , 1989 .
[448] Nicholas Carriero,et al. Linda and Friends , 1986, Computer.
[449] Enrico Appiani,et al. The EMMA2 multiprocessor operating system , 1991, Concurr. Pract. Exp..
[450] Jitendra Padhye,et al. Dynamic versus Adaptive Processor Allocation Policies for Message Passing Parallel Computers: An Empirical Comparison , 1996, JSSPP.
[451] Robert D. Gaglianello,et al. The evolution of HPC/VORX , 1990, PPOPP '90.
[452] Asser N. Tantawi,et al. Performance analysis of parallel processing systems , 1987, SIGMETRICS '87.
[453] Anja Feldmann,et al. Optimal online scheduling of parallel jobs with dependencies , 1993, STOC.
[454] Mark Furtney. Parallel Processing at Cray Research, Inc. , 1990 .
[455] Brian N. Bershad,et al. The interaction of architecture and operating system design , 1991, ASPLOS IV.
[456] Michael L. Nelson,et al. Concurrent programming in Smalltalk-80 , 1990, SIGP.
[457] Phillip Krueger,et al. ob Scheduling is More Important than Processor Allocation for Hypercube Computers , 1994, IEEE Trans. Parallel Distributed Syst..
[458] Jau-Hsiung Huang,et al. On Parallel Processing Systems: Amdahl's Law Generalized and Some Results on Optimal Design , 1992, IEEE Trans. Software Eng..
[459] Evangelos P. Markatos,et al. Implementation Issues for the Psyche Multiprocessor Operating System , 1989, Comput. Syst..
[460] Y.-W. Ma,et al. The architecture of replica: A special-purpose computer system for active multi-sensory perception of 3-dimentional objects , 1984, ISCA '84.
[461] Chita R. Das,et al. On Dependability Evaluation of Mesh-Connected Processors , 1995, IEEE Trans. Computers.
[462] Eli Upfal,et al. A simple load balancing scheme for task allocation in parallel machines , 1991, SPAA '91.
[463] Mosur Ravishankar,et al. PLUS: a distributed shared-memory system , 1990, ISCA '90.
[464] Jesús Labarta,et al. Analyzing Scheduling Policies Using Dimemas , 1997, Parallel Comput..
[465] Matthew Haines,et al. On the design of Chant: a talking threads package , 1994, Proceedings of Supercomputing '94.
[466] Satish K. Tripathi,et al. Processor scheduling on multiprogrammed, distributed memory parallel computers , 1993, SIGMETRICS '93.
[467] Ajay K. Gupta,et al. Load Balanced Priority Queues on Distributed Memory Machines , 1994 .
[468] Butler W. Lampson,et al. Experience with processes and monitors in Mesa , 1980, CACM.
[469] Farokh B. Bastani,et al. Robust parallel resource management in shared memory multiprocessor systems , 1995, Proceedings of 9th International Parallel Processing Symposium.
[470] Anne Rogers,et al. Process decomposition through locality of reference , 1989, PLDI '89.
[471] Robert J. Fowler,et al. NUMA policies and their relation to memory architecture , 1991, ASPLOS IV.
[472] L.M. Ni,et al. Trapezoid Self-Scheduling: A Practical Scheduling Scheme for Parallel Compilers , 1993, IEEE Trans. Parallel Distributed Syst..
[473] George Cybenko,et al. Dynamic Load Balancing for Distributed Memory Multiprocessors , 1989, J. Parallel Distributed Comput..
[474] Brian N. Bershad,et al. Dynamic node reconfiguration in a parallel-distributed environment , 1991, PPOPP '91.
[475] Hyunsoo Yoon,et al. Free Submesh List Strategy: a Best Fit Submesh Allocation in Mesh Connected Multicomputers , 1996, Parallel Process. Lett..
[476] Frederica Darema,et al. A single-program-multiple-data computational model for EPEX/FORTRAN , 1988, Parallel Comput..
[477] DAVID P. HELMBOLD,et al. Modeling Speedup (n) Greater than n , 1990, IEEE Trans. Parallel Distributed Syst..
[478] Bob Beck. AAMP: a multiprocessor approach for operating system and application migration , 1990, OPSR.
[479] Richard J. Enbody,et al. Managing the Overall Balance of Operating System Threads on a Multiprocessor Using Automatic Self-Allocating Threads (ASAT) , 1996, J. Parallel Distributed Comput..
[480] Murray Cole,et al. Algorithmic Skeletons: Structured Management of Parallel Computation , 1989 .
[481] Dannie Durand,et al. Impact of Memory Contention on Dynamic Scheduling on Numa Multiprocessors , 1993, 1993 International Conference on Parallel Processing - ICPP'93.
[482] Peter A. Buhr,et al. The μsystem: Providing light‐weight concurrency on shared‐memory multiprocessor computers running UNIX , 1990, Softw. Pract. Exp..
[483] Robert H. Halstead,et al. Lazy task creation: a technique for increasing the granularity of parallel programs , 1990, LISP and Functional Programming.
[484] Evgenia Smirni,et al. Measuring the Effects of Thread Placement on the Kendall Square KSR1 , 1993 .
[485] Laxmi N. Bhuyan,et al. An Adaptive Submesh Allocation Strategy for Two-Dimensional Mesh Connected Systems , 1993, 1993 International Conference on Parallel Processing - ICPP'93.
[486] David Callahan,et al. A future-based parallel language for a general-purpose highly-parallel computer , 1990 .
[487] Samuel T. Chanson,et al. A hydro-dynamic approach to heterogeneous dynamic load balancing in a network of computers , 1996, Proceedings of the 1996 ICPP Workshop on Challenges for Parallel Processing.
[488] Mary K. Vernon,et al. Use of application characteristics and limited preemption for run-to-completion parallel processor scheduling policies , 1994, SIGMETRICS.
[489] Constantine D. Polychronopoulos. Multiprocessing versus Multiprogramming , 1989, ICPP.
[490] Lionel M. Ni,et al. Scalable Problems and Memory-Bounded Speedup , 1993, J. Parallel Distributed Comput..
[491] Steven Lucco,et al. A dynamic scheduling method for irregular parallel programs , 1992, PLDI '92.
[492] Karsten Schwan,et al. Global Data and Control in Multicomputers: Operating System Primitives and Experimentation with a Parallel Branch-and-Bound Algorithm , 1990, Concurrency Practice and Experience.
[493] Uwe Schwiegelshohn,et al. Theory and Practice in Parallel Job Scheduling , 1997, JSSPP.
[494] Sheldon B. Levenstein,et al. Architecture, design, and performance of Application System/400 (AS/400) multiprocessors , 1992, IBM J. Res. Dev..
[495] David L. Black,et al. Translation lookaside buffer consistency: a software approach , 1989, ASPLOS III.
[496] Richard N. Lagerstrom,et al. PScheD: Political Scheduling on the CRAY T3E , 1997, JSSPP.
[497] M. J. Beckerle,et al. Overview of the START(*T) multithreaded computer , 1993, Digest of Papers. Compcon Spring.
[498] Satish K. Tripathi,et al. An analysis of several processor partitioning policies for parallel computers , 1991 .
[499] Raphael A. Finkel,et al. An Operating Systems Vade Mecum , 1986 .
[500] James R. Larus,et al. Cache considerations for multiprocessor programmers , 1990, CACM.
[501] Daniel P. Siewiorek,et al. Performance Prediction and Calibration for a Class of Multiprocessors , 1988, IEEE Trans. Computers.
[502] J DallyWilliam,et al. Performance Analysis of k-ary n-cube Interconnection Networks , 1990 .
[503] Anthony P. Reeves,et al. Strategies for Dynamic Load Balancing on Highly Parallel Computers , 1993, IEEE Trans. Parallel Distributed Syst..
[504] Kenneth E. Batcher,et al. Design of a Massively Parallel Processor , 1980, IEEE Transactions on Computers.
[505] Mario Dal Cin,et al. MEMSY - A Modular Expandable Multiprocessor System , 1993, Parallel Computer Architectures.
[506] Hesham H. Ali,et al. On the Intractability of Task Allocation in Distributed Systems , 1994, Parallel Process. Lett..
[507] David May,et al. Communicating Process Architecture: Transputers and Occam , 1986, Future Parallel Computers.
[508] Howard Jay Siegel,et al. PASM: A Partitionable SIMD/MIMD System for Image Processing and Pattern Recognition , 1981, IEEE Transactions on Computers.
[509] Hideharu Amano,et al. A static scheduling system for a parallel machine (SM)2-II , 1989, PARLE.
[510] Larry Rudolph,et al. Distributed hierarchical control for parallel processing , 1990, Computer.
[511] Dror G. Feitelson,et al. Job Characteristics of a Production Parallel Scientivic Workload on the NASA Ames iPSC/860 , 1995, JSSPP.
[512] John Zahorjan,et al. Zahorjan processor allocation policies for message-passing parallel computers , 1994, SIGMETRICS 1994.
[513] Mark A. Johnson,et al. Solving problems on concurrent processors. Vol. 1: General techniques and regular problems , 1988 .
[514] Oscar Kipersztok,et al. Intelligent Fuzzy Control to Augment Scheduling Capabilities of Network Queueing Systems , 1995, JSSPP.
[515] Andrew S. Tanenbaum,et al. Distributed operating systems , 2009, CSUR.
[516] Larry Rudolph,et al. Dynamic decentralized cache schemes for mimd parallel processors , 1984, ISCA '84.
[517] Johnny S. Wong,et al. Efficient Task Migration Algorithm for Distributed Systems , 1992, IEEE Trans. Parallel Distributed Syst..
[518] E. Burke. An overview of system software for the KSR 1 , 1993, Digest of Papers. Compcon Spring.
[519] Anant Agarwal,et al. Waiting algorithms for synchronization in large-scale multiprocessors , 1993, TOCS.
[520] Perry A. Emrath. Xylem: An Operating System for the Cedar Multiprocessor , 1985, IEEE Software.
[521] Anoop Gupta,et al. Scheduling and page migration for multiprocessor compute servers , 1994, ASPLOS VI.
[522] Larry Rudolph,et al. Envelopes in Adaptive Local Queues for MIMD Load Balancing , 1992, CONPAR.
[523] Jonathan Robinson,et al. Hector: automated task allocation for MPI , 1996, Proceedings of International Conference on Parallel Processing.
[524] Robert H. Halstead,et al. The MuNet: A scalable decentralized architecture for parallel computation , 1980, ISCA '80.
[525] S. F. Nugent,et al. The iPSC/2 direct-connect communications technology , 1988, C3P.
[526] Anoop Gupta,et al. Hiding memory latency using dynamic scheduling in shared-memory multiprocessors , 1992, ISCA '92.
[527] Dror G. Feitelson,et al. Packing Schemes for Gang Scheduling , 1996, JSSPP.
[528] Kenneth C. Knowlton,et al. A fast storage allocator , 1965, CACM.
[529] Jau-Hsiung Huang,et al. Performance Evaluation of Dynamic Sharing of Processors in Two-Stage Parallel Processing Systems , 1993, IEEE Trans. Parallel Distributed Syst..
[530] David L. Black,et al. An OSF/1 UNIX for Massively Parallel Multicomputers , 1993, USENIX Winter.
[531] Howard Jay Siegel. The Theory Underlying the Partitioning of Permutation Networks , 1980, IEEE Transactions on Computers.
[532] Richard Gibbons,et al. A Historical Application Profiler for Use by Parallel Schedulers , 1997, JSSPP.
[533] Donald E. Knuth,et al. The art of computer programming: V.1.: Fundamental algorithms , 1997 .
[534] Paul Hudak,et al. Alfalfa: Distributed graph reduction on a hypercube multiprocessor , 1986, Graph Reduction.
[535] B. Bose,et al. A new strategy for processors allocation in an N-cube multiprocessor , 1989, Eighth Annual International Phoenix Conference on Computers and Communications. 1989 Conference Proceedings.
[536] Ken Kennedy,et al. A static performance estimator to guide data partitioning decisions , 1991, PPOPP '91.
[537] Mary K. Vernon,et al. Dynamic vs. Static Quantum-Based Parallel Processor Allocation , 1996, JSSPP.
[538] Douglas W. Jones,et al. Concurrent operations on priority queues , 1989, CACM.
[539] W. Daniel Hillis,et al. The Network Architecture of the Connection Machine CM-5 , 1996, J. Parallel Distributed Comput..