Constructing distributed schedulers using the MESSIAHS interface language
作者： Chapin , Spafford
DOI: 10.1109/HICSS.1994.323241
关键词:
摘要: The MESSIAHS project is investigating mechanisms that support task placement in heterogeneous, distributed, autonomous systems. provides a substrate on which scheduling algorithms can be implemented. These were designed to diverse and load balancing algorithms. As part of this work, we have constructed an interface layer the underlying mechanisms. This includes Interface Language (MIL for constructing distributed schedulers. paper gives overview MESSIAHS, describes sample detail, example implementations well-known from literature built using layer. >
sci-hub.se 参考文章(23)
Michael J. Litzkow, REMOTE UNIX TURNING IDLE WORKSTATIONS INTO CYCLE SERVERS ,(1992)
Eugene H. Spafford, Steve Chapin, Scheduling Support for an Internetwork of Heterogeneous, Autonomous Processors ,(1991)
Frank Eliassen, Jari Veijalainen, Language support for Multi-database Transactions in a Cooperative , Autonomous Environment ieee region 10 conference. pp. 277- 281 ,(1987)
A. Ghafoor, I. Ahmad, An efficient model of dynamic task scheduling for distributed systems computer software and applications conference. pp. 442- 447 ,(1990) , 10.1109/CMPSAC.1990.139406
Sidney J. Stuart, Robert D. Silverman, A distributed batching system for parallel processing Software - Practice and Experience. ,vol. 19, pp. 1163- 1174 ,(1989)
Vivek Sarkar, John Hennessy, Compile-time partitioning and scheduling of parallel programs compiler construction. ,vol. 21, pp. 17- 26 ,(1986) , 10.1145/12276.13313
Vivek Sarkar, John Hennessy, Partitioning parallel programs for macro-dataflow international conference on functional programming. pp. 202- 211 ,(1986) , 10.1145/319838.319863
Mic Bowman, Larry L. Peterson, Andrey Yeatts, Univers: an attribute-based name server Software - Practice and Experience. ,vol. 20, pp. 403- 424 ,(1990) , 10.1002/SPE.4380200406
Shyamal Chowdhury, The greedy load sharing algorithm Journal of Parallel and Distributed Computing. ,vol. 9, pp. 93- 99 ,(1990) , 10.1016/0743-7315(90)90117-8
Dorit S. Hochbaum, David B. Shmoys, A polynomial approximation scheme for scheduling on uniform processors: Using the dual approximation approach SIAM Journal on Computing. ,vol. 17, pp. 539- 551 ,(1988) , 10.1137/0217033