A Note on the Complexity of Scheduling for Precedence Constrained Messages in Distributed Systems

Koji GODA; Toshinori YAMADA; Shuichi UENO

首页> 外文期刊>IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences >A Note on the Complexity of Scheduling for Precedence Constrained Messages in Distributed Systems

【24h】

A Note on the Complexity of Scheduling for Precedence Constrained Messages in Distributed Systems

机译：关于分布式系统中优先约束消息的调度复杂性的注记

获取原文

获取原文并翻译 | 示例

获取外文期刊封面封底 >>

开具论文收录证明 >>

文献代查 >>

团队文献服务 >>

页面导航

摘要
著录项
相似文献
相关主题

摘要

This note considers a problem of minimum length scheduling for a set of messages subject to precedence constraints for switching and communication networks, and shows some improvements upon previous results on the problem.

机译：本注释考虑了一组消息的最小长度调度问题，该消息受交换和通信网络的优先约束，并显示了对该问题先前的结果的一些改进。

著录项

来源
《IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences 》 |2005年第4期| p.1090-1092| 共3页
作者
Koji GODA; Toshinori YAMADA; Shuichi UENO;
展开▼
作者单位

Dept. of Communications and Integrated Systems, Graduate School of Science and Engineering, Tokyo Institute of Technology, Tokyo, 152-8552 Japan;

展开▼
收录信息
原文格式 PDF
正文语种 eng
中图分类无线电电子学、电信技术 ;
关键词
scheduling; NP-completeness; approximation algorithm;

机译：调度;NP完备性;近似算法;

相似文献

外文文献
中文文献
专利

1. Complexity of minimum length scheduling for precedence constrained messages in distributed systems [J] . Barcaccia P., Bonuccelli M.A. IEEE Transactions on Parallel and Distributed Systems . 2000 ,第10期

机译：分布式系统中优先约束消息的最小长度调度的复杂性
2. A Message-Optimal Distributed Graph Algorithm: Partial Precedence Constrained Scheduling [J] . Pranay Chaudhuri, Hussein Thompson Journal of Universal Computer Science . 2004 ,第2期

机译：消息最优的分布式图算法：部分优先约束调度
3. A Message-Optimal Distributed Graph Algorithm: Partial Precedence Constrained Scheduling [J] . Pranay Chaudhuri, Hussein Thompson Journal of Universal Computer Science . 2004 ,第2期

机译：消息最优的分布式图算法：部分优先约束调度
4. A Note on the Complexity of Scheduling for Precedence Constrained Messages in Distributed Systems [C] . Koji GODA, Toshinori YAMADA, Shuichi UENO 情報処理学会全国大会 . 2003

机译：关于分布式系统中优先约束消息的调度复杂性的注记
5. Compile-time scheduling of precedence-constrained task graphs onto interconnection-constrained heterogeneous processor architectures [D] . Dandamudi, Siva Kumar V. 1995

机译：将优先级受限的任务图编译时调度到互连受限的异构处理器体系结构上
6. Dynamic Clustering and Coordinated User Scheduling for Cooperative Interference Cancellation on Ultra-High Density Distributed Antenna Systems [O] . Kazuki Maruta 2018

机译：用于超高密度分布式天线系统的合作干扰消除的动态聚类和协调用户调度
7. A Note on the Complexity of Scheduling for Precedence Constrained Messages in Distributed Systems ∗ [O] . Koji Goda, Toshinori Yamada, Shuichi Ueno 2015

机译：关于分布式系统中优先约束消息调度复杂性的一点注意事项*

A Note on the Complexity of Scheduling for Precedence Constrained Messages in Distributed Systems

摘要

著录项

相似文献

相关主题

期刊订阅