#### Filter Results:

- Full text PDF available (147)

#### Publication Year

1990

2018

- This year (36)
- Last 5 years (168)
- Last 10 years (186)

#### Publication Type

#### Co-author

#### Journals and Conferences

#### Data Set Used

#### Key Phrases

Learn More

- Keqin Li, Yi Pan, Si-Qing Zheng
- IEEE Trans. Parallel Distrib. Syst.
- 1998

We present efficient parallel matrix multiplication algorithms for linear arrays with reconfigurable pipelined bus systems (LARPBS). Such systems are able to support a large volume of parallel communication of various patterns in constant time. An LARPBS can also be reconfigured into many independent subsystems and, thus, is able to support parallel… (More)

- Yuming Xu, Kenli Li, Jingtong Hu, Keqin Li
- Inf. Sci.
- 2014

- Keqin Li, Kam-Hoi Cheng
- IEEE Trans. Parallel Distrib. Syst.
- 1991

In this paper, we address the job scheduling problem in a partitionable mesh-connected system when jobs require square meshes and the system is a square mesh of size a power of two. We present a heuristic algorithm of time complexity O(n(log n + log p))where n is the number of jobs to be scheduled and p is the size of the system. The algorithm adopts the… (More)

- Kenli Li, Xiaoyong Tang, Keqin Li
- IEEE Transactions on Parallel and Distributed…
- 2014

In the past few years, with the rapid development of heterogeneous computing systems (HCS), the issue of energy consumption has attracted a great deal of attention. How to reduce energy consumption is currently a critical issue in designing HCS. In response to this challenge, many energy-aware scheduling algorithms have been developed primarily using the… (More)

- Keqin Li
- Journal of Systems Architecture - Embedded…
- 2008

- Keqin Li, Kam-Hoi Cheng
- J. Parallel Distrib. Comput.
- 1990

The static job scheduling problem in apartitionable mesh connected system (PMCS) is addressed. The relationship between static job scheduling and system partitioning is discussed and a lower bound for the absolute worst case performance of any polynomial time static job scheduling approximation algorithm in PMCS is obtained. A heuristic algorithm based on… (More)

- Keqin Li
- IEEE Transactions on Parallel and Distributed…
- 2013

The performance of dynamic distance-based location management schemes (DBLMS) in wireless communication networks is analyzed. A Markov chain is developed as a mobility model to describe the movement of a mobile terminal in 2D cellular structures. The paging area residence time is characterized for arbitrary cell residence time by using the Markov chain. The… (More)

- Yi Pan, Keqin Li, Si-Qing Zheng
- ISPAN
- 1997

- Zhuo Tang, Ling Qi, Zhenzhen Cheng, Kenli Li, Samee Ullah Khan, Keqin Li
- Journal of Grid Computing
- 2015

The growth of energy consumption has been explosive in current data centers, super computers, and public cloud systems. This explosion has led to greater advocacy of green computing, and many efforts and works focus on the task scheduling in order to reduce energy dissipation. In order to obtain more energy reduction as well as maintain the quality of… (More)