Scheduling multiprocessor tasks — An overview☆

A more efficient and secure ID-based remote mutual authentication with key agreement scheme for mobile devices on elliptic curve cryptosystem

Selected problems of scheduling tasks in multiprocessor computer systems

With the popularity of computer network, smart card based remote user authentication is receiving more and more attention than ever. Recently, Liaw et al. proposed an efficient and complete remote user authentication scheme using smart cards. Its security depends on the one-way hash function and is nonce-based. They claim that it achieves more functionality and satisfies all criteria and can withstand the replay attack. Nevertheless, there still exist several security flaws in their scheme. In this paper, we give a cryptanalysis of the scheme and present that the scheme is vulnerable and insecure against at least four kinds of attack, including the offline password guessing attack, two impersonation attacks, the intruder-in-the-middle attack and the denial-of-service attack.

Cryptanalysis of a Remote User Authentication Scheme Using Smart Cards

It is provided that a security analysis on Liaw-Lin-Wu’s remote user authentication scheme. Our analysis shows the scheme is vulnerable to Man-inthe-middle attack. What’s more, there are obvious security vulnerabilities in it. An improved remote user authentication scheme based on Diffie-Hellman key exchange protocol is proposed. Analysis shows the scheme is secure not only to achieve mutual authentication, but also to generate a session key in the same time. It has overcome security deficiencies of Liaw-Lin-Wu’s scheme. It is efficient and practical.

Information Computing and Applications

An efficient and complete remote user authentication scheme using smart cards

A new electronic traveler's check scheme based on one-way hash function

This paper considers the problem of scheduling nonpreemptive multiprocessor tasks in a homogeneous system of processors. The problem proposed in this paper is different from the conventional scheduling problem, where each task requires only “one” processor whenever it is in processing. In our multiprocessor task scheduling problem, tasks can require more than one processor at a time for their processing, that is, tasks in our problem require simultaneously “ j ” arbitrary processors when they start to be processed, where 1 ≤ j ≤ k and k is a fixed number. Though multiprocessor tasks considered in this paper are assumed to be independent, i.e., the precedence relation does not exist among them, such a problem of scheduling nonpreemptive multiprocessor tasks is NP-complete. Therefore, a heuristic algorithm is investigated for this kind of problem and the worst performance bounds of the algorithm are also derived.

Scheduling algorithm for nonpreemptive multiprocessor tasks

Performance Bounds on Scheduling Parallel Tasks with Communication Cost

This paper investigates the problem of nonpreemptively scheduling independent parallel tasks in an environment with multiple machines, which is motivated from the recent studies in scheduling tasks in a multi-machine environment. In this scheduling environment, each machine contains a number of identical processors and each parallel task can simultaneously require a number of processors for its processing in any single machine. Whenever tasks are processed in parallel in a parallel machine, message communication among processors is often inevitable. The problem of finding a shortest schedule length on scheduling independent parallel tasks with the consideration of communication overhead in a multi-machine environment is NP-hard. The aim of this paper is to propose a heuristic algorithm for this kind of problem and to analyze the performance bound of this heuristic algorithm.

/pdf/scheduling-parallel-tasks-with-communication-overhead-in-an-4jfjcivyyg.pdf

Jiann-Fu Lin

Papers

An efficient and complete remote user authentication scheme using smart cards

A new electronic traveler's check scheme based on one-way hash function

Scheduling algorithm for nonpreemptive multiprocessor tasks

Performance Bounds on Scheduling Parallel Tasks with Communication Cost

Scheduling Parallel Tasks with Communication Overhead in an Environment with Multiple Machines