Agrawala, Ashok K.
Overview
Works:  169 works in 362 publications in 1 language and 2,537 library holdings 

Genres:  Conference papers and proceedings 
Roles:  Author, Editor 
Classifications:  QA76.6, 001.642 
Publication Timeline
.
Most widely held works by
Ashok K Agrawala
Foundations of microprogramming : architecture, software, and applications by
Ashok K Agrawala(
Book
)
17 editions published between 1975 and 2014 in English and held by 488 WorldCat member libraries worldwide
Introduction to microprogramming concepts; Architectural characteristics of microprogrammed computers; Microprogramming languages and support software; Computers with vertical microinstructions; Computers with diagonal microinstructions; Computers with horizontal microinstructions; Developments in microprogramming languages; Applications of microprogramming; Perspective
17 editions published between 1975 and 2014 in English and held by 488 WorldCat member libraries worldwide
Introduction to microprogramming concepts; Architectural characteristics of microprogrammed computers; Microprogramming languages and support software; Computers with vertical microinstructions; Computers with diagonal microinstructions; Computers with horizontal microinstructions; Developments in microprogramming languages; Applications of microprogramming; Perspective
Machine recognition of patterns by
Ashok K Agrawala(
Book
)
13 editions published in 1977 in English and held by 355 WorldCat member libraries worldwide
13 editions published in 1977 in English and held by 355 WorldCat member libraries worldwide
Open systems interconnection : its architecture and protocols by
Bijendra N Jain(
Book
)
15 editions published between 1990 and 1993 in English and held by 315 WorldCat member libraries worldwide
15 editions published between 1990 and 1993 in English and held by 315 WorldCat member libraries worldwide
Realtime system design by
ShemTov Levi(
Book
)
13 editions published in 1990 in English and held by 294 WorldCat member libraries worldwide
Computer Systems Organization  SpecialPurpose and ApplicationBased Systems
13 editions published in 1990 in English and held by 294 WorldCat member libraries worldwide
Computer Systems Organization  SpecialPurpose and ApplicationBased Systems
Fault tolerant system design by
ShemTov Levi(
Book
)
12 editions published in 1994 in English and Undetermined and held by 198 WorldCat member libraries worldwide
12 editions published in 1994 in English and Undetermined and held by 198 WorldCat member libraries worldwide
A guide to major job accounting systems : the Logger system of the UNIVAC 1100 series operating system by
Jeffrey Myron Mohr(
Book
)
7 editions published in 1978 in English and held by 145 WorldCat member libraries worldwide
7 editions published in 1978 in English and held by 145 WorldCat member libraries worldwide
Performance '83 : proceedings of the 9th International Symposium on Computer Performance Modelling, Measurement, and Evaluation,
College Park, Maryland, U.S.A., May 2527, 1983 by Measurement and Evaluation$ (9e : 1983 : College Park, Md.) IFIP International Symposium on Computer Performance Modelling(
Book
)
11 editions published in 1983 in English and held by 141 WorldCat member libraries worldwide
11 editions published in 1983 in English and held by 141 WorldCat member libraries worldwide
Mission critical operating systems(
Book
)
7 editions published between 1991 and 1992 in English and Undetermined and held by 70 WorldCat member libraries worldwide
7 editions published between 1991 and 1992 in English and Undetermined and held by 70 WorldCat member libraries worldwide
Evaluation of a decomposition approach for realtime scheduling using a stochastic model by
Xiaoping Yuan(
Book
)
4 editions published in 1990 in English and Undetermined and held by 7 WorldCat member libraries worldwide
Abstract: "In this paper, a stochastic model is developed to evaluate the decomposition scheduling approach [Yuan89a]. Since the scheduling complexity of the approach directly depends on the number of tasks in every subset, we calculate the probability of the event thath [sic] 'there are n tasks in a subset, ' for any n, and then the expected number of tasks in a subset. The results indicate that the decomposition scheduling technique not only assures the generation of a feasible schedule if one exists, but also is computationally efficient."
4 editions published in 1990 in English and Undetermined and held by 7 WorldCat member libraries worldwide
Abstract: "In this paper, a stochastic model is developed to evaluate the decomposition scheduling approach [Yuan89a]. Since the scheduling complexity of the approach directly depends on the number of tasks in every subset, we calculate the probability of the event thath [sic] 'there are n tasks in a subset, ' for any n, and then the expected number of tasks in a subset. The results indicate that the decomposition scheduling technique not only assures the generation of a feasible schedule if one exists, but also is computationally efficient."
Temporal relations and structures in realtime operating systems by
ShemTov Levi(
Book
)
3 editions published in 1987 in English and held by 7 WorldCat member libraries worldwide
The temporal properties of objects in a realtime, distributed, faulttolerant, reactive operating systems are defined and analyzed. Accordingly, properties associated with the scheduleability of accepted jobs whose deadlines are guaranteed are examined. Special mechanisms that support temporal inference are proposed. These mechanisms support explicit time expression, precedence relations, and projections of the knowledge of realtime at different localities. Special data structures, called calendars, are proposed for management and planning of activities and for scheduling. Algorithms that verify scheduleability of arriving requests are introduced, ensuring that alreadygiven guarantees for alreadyaccepted jobs are not violated
3 editions published in 1987 in English and held by 7 WorldCat member libraries worldwide
The temporal properties of objects in a realtime, distributed, faulttolerant, reactive operating systems are defined and analyzed. Accordingly, properties associated with the scheduleability of accepted jobs whose deadlines are guaranteed are examined. Special mechanisms that support temporal inference are proposed. These mechanisms support explicit time expression, precedence relations, and projections of the knowledge of realtime at different localities. Special data structures, called calendars, are proposed for management and planning of activities and for scheduling. Algorithms that verify scheduleability of arriving requests are introduced, ensuring that alreadygiven guarantees for alreadyaccepted jobs are not violated
Scheduling of periodic tasks with relative timing constraints by
University of Maryland at College Park(
Book
)
3 editions published between 1994 and 1995 in English and held by 7 WorldCat member libraries worldwide
Abstract: "The problem of nonpreemptive scheduling of a set of periodic tasks on a single processor has been traditionally considering the ready time and deadline on each task. As a consequence, a feasible schedule finds that in each period one instance of each task starts the execution after the ready time and completes the execution before the deadline. Recently, the timing requirements of the realtime systems emerge that the relative timing constraints are imposed on the consecutive executions of each task. In this paper, we consider the scheduling problem of the periodic tasks with the relative timing constraints imposed on two consecutive executions of a task. We analyze the timing constraints and derive the scheduling window for each task instance. Based on the scheduling window, we present the timebased approach of scheduling a task instance. The task instances are scheduled one by one based on their priorities assigned by the proposed algorithms in this paper. We conduct the experiments to compare the schedulability of the algorithms."
3 editions published between 1994 and 1995 in English and held by 7 WorldCat member libraries worldwide
Abstract: "The problem of nonpreemptive scheduling of a set of periodic tasks on a single processor has been traditionally considering the ready time and deadline on each task. As a consequence, a feasible schedule finds that in each period one instance of each task starts the execution after the ready time and completes the execution before the deadline. Recently, the timing requirements of the realtime systems emerge that the relative timing constraints are imposed on the consecutive executions of each task. In this paper, we consider the scheduling problem of the periodic tasks with the relative timing constraints imposed on two consecutive executions of a task. We analyze the timing constraints and derive the scheduling window for each task instance. Based on the scheduling window, we present the timebased approach of scheduling a task instance. The task instances are scheduled one by one based on their priorities assigned by the proposed algorithms in this paper. We conduct the experiments to compare the schedulability of the algorithms."
Optimal replication of seriesparallel graphs for computation intensive applications by ShengTzong Cheng(
Book
)
2 editions published between 1993 and 1994 in English and held by 7 WorldCat member libraries worldwide
Abstract: "We consider the replication problem of seriesparallel (SP) task graphs where each task may run on more than one processor. The objective of the problem is to minimize the total cost of task execution and interprocessor communication. We call it, the minimum cost replication problem for SP graphs (MCRPSP). In this paper, we adopt a new communication model where the purpose of replication is to reduce the total cost. The class of applications we consider is computationintensive applications in which the execution cost of a task is greater than its communication cost. The complexity of MCRPSP for such applications is proved to be NPcomplete. We present a branchandbound method to find an optimal solution as well as an approximation approach for suboptimal solution. The numerical results show that such replication may lead to a lower cost than the optimal assignment problem (in which each task is assigned to only one processor) does. The proposed optimal solution has the complexity of O(n²2[superscript n]M), while the approximation solution has O(n⁴M²), where n is the number of processors in the system and M is the number of tasks in the graph."
2 editions published between 1993 and 1994 in English and held by 7 WorldCat member libraries worldwide
Abstract: "We consider the replication problem of seriesparallel (SP) task graphs where each task may run on more than one processor. The objective of the problem is to minimize the total cost of task execution and interprocessor communication. We call it, the minimum cost replication problem for SP graphs (MCRPSP). In this paper, we adopt a new communication model where the purpose of replication is to reduce the total cost. The class of applications we consider is computationintensive applications in which the execution cost of a task is greater than its communication cost. The complexity of MCRPSP for such applications is proved to be NPcomplete. We present a branchandbound method to find an optimal solution as well as an approximation approach for suboptimal solution. The numerical results show that such replication may lead to a lower cost than the optimal assignment problem (in which each task is assigned to only one processor) does. The proposed optimal solution has the complexity of O(n²2[superscript n]M), while the approximation solution has O(n⁴M²), where n is the number of processors in the system and M is the number of tasks in the graph."
A class of optimal decentralized commit protocols by
S.M Yuan(
Book
)
3 editions published in 1987 in English and held by 6 WorldCat member libraries worldwide
This paper studies the message complexity of decentralized commit protocols. It shows that Theta (kNN to the 1/k power) messages are necessary only if k rounds of message interchanges are allowed. It also shows that Theta (n1nN) is a message lower bound for any decentralized commit protocol. Finally, a class of decentralized commit protocols are proposed which need Theta (kNN to the 1/k power) messages and use k rounds of message interchanges. If we let k=1nN then we can get a decentralized commit protocol which needs Theta (N1nN) messages only
3 editions published in 1987 in English and held by 6 WorldCat member libraries worldwide
This paper studies the message complexity of decentralized commit protocols. It shows that Theta (kNN to the 1/k power) messages are necessary only if k rounds of message interchanges are allowed. It also shows that Theta (n1nN) is a message lower bound for any decentralized commit protocol. Finally, a class of decentralized commit protocols are proposed which need Theta (kNN to the 1/k power) messages and use k rounds of message interchanges. If we let k=1nN then we can get a decentralized commit protocol which needs Theta (N1nN) messages only
Allocation of realtime computations under fault tolerance constraints by
ShemTov Levi(
Book
)
3 editions published in 1988 in English and held by 6 WorldCat member libraries worldwide
Allocation of resources in next generation real time operating systems requires some important features in addition to those demonstrated by current systems, resulting in an increased complexity of each system. The allocation is closely related to the scheduling, and the two are based on time considerations, rather then on a static priority scheme. The allocation is fault tolerance motivated, to cope with the application's reliability goals. Distributed system issues and adaptive behavior requirements increase the complexity and significance of the allocation approach. The allocation scheme proposed here accomplishes the hard real time goal of guaranteeing a deadline satisfaction in case the job is accepted. In addition, this allocation scheme supports fault tolerance objectives in both damage containment and resiliency requirements. It does this in cooperation with a schedulability verification mechanism, and with an object architecture in which for each object there exists a calendar that maintains the time of its execution. A nice feature of this scheme is the way in which it can be used for reallocation while increasing the resiliency. Keywords: Real time, Resources management, Operating systems. (jhd)
3 editions published in 1988 in English and held by 6 WorldCat member libraries worldwide
Allocation of resources in next generation real time operating systems requires some important features in addition to those demonstrated by current systems, resulting in an increased complexity of each system. The allocation is closely related to the scheduling, and the two are based on time considerations, rather then on a static priority scheme. The allocation is fault tolerance motivated, to cope with the application's reliability goals. Distributed system issues and adaptive behavior requirements increase the complexity and significance of the allocation approach. The allocation scheme proposed here accomplishes the hard real time goal of guaranteeing a deadline satisfaction in case the job is accepted. In addition, this allocation scheme supports fault tolerance objectives in both damage containment and resiliency requirements. It does this in cooperation with a schedulability verification mechanism, and with an object architecture in which for each object there exists a calendar that maintains the time of its execution. A nice feature of this scheme is the way in which it can be used for reallocation while increasing the resiliency. Keywords: Real time, Resources management, Operating systems. (jhd)
Objects architecture : a comprehensive design approach for realtime, distributed, faulttolerant, reactive operating systems by
ShemTov Levi(
Book
)
3 editions published in 1987 in English and held by 6 WorldCat member libraries worldwide
The applicability of objects architecture for designing realtime reactive operating systems is examined through a model of its elements, their relationships and operations. The requirements of creation, deletion and manipulation of objects in a distributed system with a high degree of fault tolerance are introduced and analyzed. Then, the imposition of time constraints is introduced, and its influence on the objects architecture is analyzed. Relationships with other objects and additional fault tolerance relations are considered. Finally, examples of some solutions to fundamental realtime problems are proposed. Keywords: Systems engineering; Embedding; Computer programming
3 editions published in 1987 in English and held by 6 WorldCat member libraries worldwide
The applicability of objects architecture for designing realtime reactive operating systems is examined through a model of its elements, their relationships and operations. The requirements of creation, deletion and manipulation of objects in a distributed system with a high degree of fault tolerance are introduced and analyzed. Then, the imposition of time constraints is introduced, and its influence on the objects architecture is analyzed. Relationships with other objects and additional fault tolerance relations are considered. Finally, examples of some solutions to fundamental realtime problems are proposed. Keywords: Systems engineering; Embedding; Computer programming
Mission critical planning : AI on the MARUTI realtime operating system by
James A Hendler(
Book
)
1 edition published in 1990 in English and held by 6 WorldCat member libraries worldwide
Critically important is the ability to correctly handle time dependent reasoning (directly modeled on the MARUTI operating system) and reaction, and to integrate such reaction with higher level plans for normal operation or error recovery."
1 edition published in 1990 in English and held by 6 WorldCat member libraries worldwide
Critically important is the ability to correctly handle time dependent reasoning (directly modeled on the MARUTI operating system) and reaction, and to integrate such reaction with higher level plans for normal operation or error recovery."
Scheduling in realtime distributed systems : a review by
Xiaoping Yuan(
Book
)
3 editions published in 1987 in English and held by 6 WorldCat member libraries worldwide
The scheduling problem is considered to be a crucial part in the design of realtime distributed computer systems. This paper gives an extensive survey of the research performed in the area of realtime scheduling, which includes localized and centralized scheduling and allocation techniques. We classify the scheduling strategies into four basic categories: static and dynamic priorities, heuristic approaches, scheduling with precedures relations, allocation policies and strategies
3 editions published in 1987 in English and held by 6 WorldCat member libraries worldwide
The scheduling problem is considered to be a crucial part in the design of realtime distributed computer systems. This paper gives an extensive survey of the research performed in the area of realtime scheduling, which includes localized and centralized scheduling and allocation techniques. We classify the scheduling strategies into four basic categories: static and dynamic priorities, heuristic approaches, scheduling with precedures relations, allocation policies and strategies
A simple nearoptimal solution to the drinking philosophers problem by David Ginat(
Book
)
3 editions published in 1989 in English and held by 6 WorldCat member libraries worldwide
Abstract: "We provide a solution to the drinking philosophers problem, defined by Chandy and Misra [1]. Our solution, unlike theirs, does not have a dining layer. By using bounded session numbers with occasional resets, we are able to reduce the message complexity per drinking session from the order of neighbors a philosopher has to the order of bottles he needs for drinking."
3 editions published in 1989 in English and held by 6 WorldCat member libraries worldwide
Abstract: "We provide a solution to the drinking philosophers problem, defined by Chandy and Misra [1]. Our solution, unlike theirs, does not have a dining layer. By using bounded session numbers with occasional resets, we are able to reduce the message complexity per drinking session from the order of neighbors a philosopher has to the order of bottles he needs for drinking."
Virtual circuits with cross traffic : model, analysis and parameter estimation by
Bijendra N Jain(
Book
)
1 edition published in 1992 in English and held by 5 WorldCat member libraries worldwide
This function is used to propose a ratebased flow control scheme that results in minimum transit delay and/or maximum throughput. A scheme to estimate critical parameters of the function from online measurements has been proposed. This scheme may also be used in conjunction with the proposed ratebased flow control scheme."
1 edition published in 1992 in English and held by 5 WorldCat member libraries worldwide
This function is used to propose a ratebased flow control scheme that results in minimum transit delay and/or maximum throughput. A scheme to estimate critical parameters of the function from online measurements has been proposed. This scheme may also be used in conjunction with the proposed ratebased flow control scheme."
Proceedings of the 9th international conference on Mobile systems, applications, and services by
Ashok K Agrawala(
)
2 editions published in 2011 in English and held by 0 WorldCat member libraries worldwide
2 editions published in 2011 in English and held by 0 WorldCat member libraries worldwide
more
fewer
Audience Level
0 

1  
Kids  General  Special 
Related Identities
Associated Subjects
AccountingData processing Artificial intelligence Canada College teachers Computer network architectures Computer network protocols Computer networks Computer science Conflict management Decomposition (Mathematics) Distributed parameter systems Electronic data processingDistributed processing Electronic digital computersEvaluation Engineers EXEC 8 (Electronic computer system) Executives Faulttolerant computing Microprogramming Operating systems (Computers) Operating systems (Computers)Design Packet switching (Data transmission) Parallel processing (Electronic computers) Pattern perception Pattern recognition systems Problem solving Queuing theory Realtime control Realtime data processing Realtime programming Research Scientists Software engineering System design United States Univac 1100 series (Computer) Univac computerProgramming
Alternative Names
Agrawala, A. K.
Agrawala, A. K. (Ashok K.)
Agrawala Ashok 1943....
Agrawala, Ashok Kumar.
Ashok K. Agrawala 1943....
Languages
Covers