WorldCat Identities

Kao, Ben

Overview
Works: 9 works in 17 publications in 1 language and 45 library holdings
Roles: Author
Classifications: TK5105.3, 004.66
Publication Timeline
.
Most widely held works by Ben Kao
Aggressive transmissions over redundant paths for time critical messages by Benjamin Chi-Ming Kao( Book )

3 editions published in 1992 in English and held by 13 WorldCat member libraries worldwide

Abstract: "Fault-tolerant computer systems have redundant paths connecting their components. Given these paths, it is possible to use aggressive techniques to reduce the average value and variability of the response time for critical messages. One technique is to send a copy of a packet over an alternate path before it is know if the first copy failed or was delayed. A second technique is to split a single stream of packets over multiple paths. We analyze both approaches and show that they can provide significant improvements over conventional, conservative mechanisms."
Real-time communication over multiple standard networks by Benjamin Chi-Ming Kao( Book )

3 editions published in 1992 in English and held by 9 WorldCat member libraries worldwide

Abstract: "In this paper we consider systems with redundant communication paths, and show how applications can exploit the redundancy to improve real-time communications. We consider two policies, one that evenly distributes load, and one that partitions load according to packet slackness. We evaluate the effectiveness of these policies through analysis and simulation."
Deadline assignment in a distributed soft real-time system by Benjamin Chi-Ming Kao( Book )

3 editions published in 1992 in English and held by 9 WorldCat member libraries worldwide

Abstract: "In a distributed environment, tasks often have processing demands on multiple different sites. A distributed task is usually divided up into several subtasks, each one to be executed at some site in order. In a real-time system, an overall deadline is usually specified by an application designer indicating when a distributed task is to be finished. However, the problem of how a global deadline is automatically translated to the deadline of each individual subtask has not been well studied. This paper examines (through simulations) four strategies for subtask deadline assignment in a distributed soft real-time environment."
Subtask deadline assignment for complex distributed soft real- time tasks by Benjamin Chi-Ming Kao( Book )

3 editions published in 1993 in English and held by 8 WorldCat member libraries worldwide

Abstract: "Complex distributed tasks often involve parallel execution of subtasks at different nodes. To meet the deadline of a global task, all of its parallel subtasks have to be finished on time. Comparing to a local task (which involves execution at only one node), a global task may have a much harder time making its deadline because it is fairly likely that at least one of its subtasks run into an overloaded node. Another problem with complex distributed tasks occurs when a global task consists of a number of serially executing subtasks. In this case, we have the problem of dividing up the end-to-end deadline of the global task and assigning them to the intermediate subtasks. In this paper, we study both of these problems. Different algorithms for assigning deadlines to subtasks are presented and evaluated."
Learning algorithms for large datasets by Benjamin Chi-Ming Kao( )

1 edition published in 2003 in English and held by 2 WorldCat member libraries worldwide

Shen sheng li xue : Ying wen yuan ban : [di 3 ban] by Benjamin Chi-Ming Kao( Book )

1 edition published in 2002 in English and held by 1 WorldCat member library worldwide

Emulating soft real-time scheduling using traditional operating system schedulers by Stanford University( Book )

1 edition published in 1994 in English and held by 1 WorldCat member library worldwide

Real-time scheduling algorithms are usually only available in the kernels of real-time operating systems, and not in more general purpose operating systems, like Unix. For some soft real-time problems, a traditional operating system may be the development platform of choice. This paper addresses methods of emulating real-time scheduling algorithms on top of standard time-share schedulers. We examine (through simulations) three strategies for priority assignment within a traditional multi-tasking environment. The results show that the emulation algorithms are comparable in performance to the real-time algorithms and in some instances outperform them
Modal analysis of a tire and wheel and its application for vehicle ride evaluation by Benjamin Chi-Ming Kao( Book )

1 edition published in 1986 in English and held by 1 WorldCat member library worldwide

Scheduling in distributed soft real-time systems with autonomous components by Benjamin Chi-Ming Kao( )

1 edition published in 1995 in English and held by 1 WorldCat member library worldwide

 
Audience Level
0
Audience Level
1
  Kids General Special  
Audience level: 0.79 (from 0.73 for Learning a ... to 0.98 for Modal anal ...)

Alternative Names
Kao, B. 1967-

Kao, B. (Benjamin), 1967-

Kao, Ben 1967-

Kao, Chi Ming 1967-

Languages
English (17)