His primary scientific interests are in Scheduling, Distributed computing, Dynamic priority scheduling, Fair-share scheduling and Rate-monotonic scheduling. His Scheduling research integrates issues from Parallel algorithm, Parallel computing, Bounded function and Probabilistic analysis of algorithms. His Parallel computing study deals with Processor scheduling intersecting with Schedule.
His Distributed computing research focuses on Resource allocation and how it relates to Algorithm design, Software system, Software agent and Multi-agent system. His Dynamic priority scheduling study frequently draws connections to other fields, such as Multiprocessing. The concepts of his Rate-monotonic scheduling study are interwoven with issues in Job shop scheduling, Heuristics and Two-level scheduling.
The scientist’s investigation covers issues in Computer network, Scheduling, Distributed computing, Wireless and Parallel computing. His biological study spans a wide range of topics, including Wireless network, Throughput and Communication channel. His Scheduling study combines topics in areas such as Parallel algorithm, Algorithm and Quality of service.
He has researched Distributed computing in several fields, including Wireless ad hoc network, Ad hoc wireless distribution service, Optimized Link State Routing Protocol, Resource allocation and Game theory. His work on Key distribution in wireless sensor networks as part of his general Wireless study is frequently connected to Resource management, thereby bridging the divide between different branches of science. In his research, Time complexity, Heuristics and Network topology is intimately related to Dynamic priority scheduling, which falls under the overarching field of Fair-share scheduling.
His main research concerns Computer network, Resource allocation, Distributed computing, Game theory and Nash equilibrium. His study on Computer network is mostly dedicated to connecting different topics, such as Wireless. His Distributed computing research incorporates themes from Game theoretic, Theoretical computer science, Selection, Protocol and Node.
Yu-Kwong Kwok usually deals with Game theory and limits it to topics linked to Wireless network and Provisioning. Yu-Kwong Kwok combines subjects such as Overlay, Field-programmable gate array and Mobile computing with his study of Scheduling. His Network packet study incorporates themes from Dissemination, Bandwidth, Physical layer and Heuristics.
Yu-Kwong Kwok mainly investigates Computer network, The Internet, Game theory, Wireless and Speech recognition. His research links Distributed computing with Computer network. His research investigates the connection between Game theory and topics such as Nash equilibrium that intersect with problems in Wireless network.
His work deals with themes such as Communication channel and Mobile computing, which intersect with Wireless. The study incorporates disciplines such as Network topology, Scheduling and Telecommunications link in addition to Quality of service. His studies deal with areas such as Overlay and Network awareness as well as Scheduling.
This overview was generated by a machine learning system which analysed the scientist’s body of work. If you have any feedback, you can contact us here.
Static scheduling algorithms for allocating directed task graphs to multiprocessors
Yu-Kwong Kwok;Ishfaq Ahmad.
ACM Computing Surveys (1999)
Dynamic critical-path scheduling: an effective technique for allocating task graphs to multiprocessors
Yu-Kwong Kwok;I. Ahmad.
IEEE Transactions on Parallel and Distributed Systems (1996)
Trusted P2P transactions with fuzzy reputation aggregation
S. Song;K. Hwang;R. Zhou;Y.-K. Kwok.
IEEE Internet Computing (2005)
Benchmarking and Comparison of the Task Graph Scheduling Algorithms
Yu-Kwong Kwok;Ishfaq Ahmad.
Journal of Parallel and Distributed Computing (1999)
On exploiting task duplication in parallel program scheduling
Ishfaq Ahmad;Yu-Kwong Kwok.
IEEE Transactions on Parallel and Distributed Systems (1998)
Source contributions to ambient VOCs and CO at a rural site in eastern China
H Guo;T Wang;I.J Simpson;D.R Blake.
Atmospheric Environment (2004)
Efficient Scheduling of Arbitrary Task Graphs to Multiprocessors Using a Parallel Genetic Algorithm
Yu-Kwong Kwok;Ishfaq Ahmad.
Journal of Parallel and Distributed Computing (1997)
Risk-resilient heuristics and genetic algorithms for security-assured grid job scheduling
S. Song;Kai Hwang;Yu-Kwong Kwok.
IEEE Transactions on Computers (2006)
Benchmarking the task graph scheduling algorithms
Y.-K. Kwok;I. Ahmad.
merged international parallel processing symposium and symposium on parallel and distributed processing (1998)
A New Approach to Scheduling Parallel Programs Using Task Duplication
I. Ahmad;Yu-Kwong Kwok Yu-Kwong Kwok.
international conference on parallel processing (1994)
If you think any of the details on this page are incorrect, let us know.
We appreciate your kind effort to assist us to improve this page, it would be helpful providing us with as much detail as possible in the text box below:
Hong Kong University of Science and Technology
The University of Texas at Arlington
Chinese University of Hong Kong, Shenzhen
University of Kent
Shanghai Jiao Tong University
Hong Kong Polytechnic University
Hong Kong Polytechnic University
University of California, Irvine
University of California, Irvine
Colorado State University
Princeton University
Renaissance Re Ltd.
University of Toronto
Utah State University
University of Genoa
Concordia University
University of Extremadura
Vanderbilt University
Erasmus University Rotterdam
University of Helsinki
Institute of Genetics and Molecular and Cellular Biology
National Institutes of Health
Portland State University
Icahn School of Medicine at Mount Sinai
Louisiana State University
Technical University of Crete