shah apurva (27 resultados)

Condición: New.

Paperback or Softback. Condición: New. Building Interactive Worlds: Designing immersive experiences for games, XR, and the metaverse (English Edition). Book.

PAP. Condición: New. New Book. Shipped from UK. Established seller since 2000.

Condición: As New. Unread book in perfect condition.

Paperback. Condición: New.

PAP. Condición: New. New Book. Shipped from UK. Established seller since 2000.

Condición: New. In English.

Condición: New.

Condición: As New. Unread book in perfect condition.

Taschenbuch. Condición: Neu. Efficient Resource Allocation for Real-Time Systems | Apurva Shah (u. a.) | Taschenbuch | 56 S. | Englisch | 2014 | LAP LAMBERT Academic Publishing | EAN 9783659566455 | Verantwortliche Person für die EU: preigu GmbH & Co. KG, Lengericher Landstr. 19, 49078 Osnabrück, mail[at]preigu[dot]de | Anbieter: preigu.

Taschenbuch. Condición: Neu. Scheduling for Real-Time Multiprocessor System | Apurva Shah (u. a.) | Taschenbuch | 60 S. | Englisch | 2014 | LAP LAMBERT Academic Publishing | EAN 9783659573668 | Verantwortliche Person für die EU: preigu GmbH & Co. KG, Lengericher Landstr. 19, 49078 Osnabrück, mail[at]preigu[dot]de | Anbieter: preigu.

Paperback. Condición: New.

Taschenbuch. Condición: Neu. Dynamic Scheduling for Real-Time Systems | Efficient Scheduling Algorithms using ACO and Conventional Techniques | Apurva Shah (u. a.) | Taschenbuch | Englisch | LAP Lambert Academic Publishing | EAN 9783659268021 | Verantwortliche Person für die EU: preigu GmbH & Co. KG, Lengericher Landstr. 19, 49078 Osnabrück, mail[at]preigu[dot]de | Anbieter: preigu.

Paperback. Condición: Like New. LIKE NEW. SHIPS FROM MULTIPLE LOCATIONS. book.

paperback. Condición: New. NEW. SHIPS FROM MULTIPLE LOCATIONS. book.

Taschenbuch. Condición: Neu. This item is printed on demand - it takes 3-4 days longer - Neuware -Resource allocation is one of the challenging problems for real-time operating system. Priority inheritance protocol (PIP) and Priority ceiling protocol are very popular for resource allocation in real time operating system. Both algorithms have certain advantages and disadvantages. In priority inheritance protocol when any higher priority job is scheduled and if that job requires the resource which is acquired by lower priority job than lower priority job inherits the priority of currently scheduled job and it will be executed when context switch occurs.Generally context switching time taken by the processor is ignored but it is having considerable impact when numbers of switches are more. Our proposed algorithm will decrease the number of context switches as it will not schedule the job which requires the resource which is already acquired by another job. By this way, overall overhead of the system is reduced. 56 pp. Englisch.

Taschenbuch. Condición: Neu. This item is printed on demand - it takes 3-4 days longer - Neuware -A scheduling algorithm schedules a set of tasks in such way that the tasks are completed before their deadlines reached. There are varieties of algorithms for scheduling of periodic tasks on multiprocessor under partitioning scheme or global scheduling scheme. The most common scheduling algorithms are: Rate Monotonic (RM), Deadline Monotonic (DM), Earliest Deadline First (EDF) and Least Laxity First (LLF). In this book, we have proposed a new algorithm titled as D_EDF which is modified conventional EDF algorithm. The proposed algorithm along with EDF, LLF, RM, DM algorithms are simulated and tested for independent, preemptive, periodic tasks on tightly coupled real-time multiprocessor system under global scheduling. From experiments and result analysis it concludes that the proposed algorithm is very efficient in both underloaded and overloaded conditions. The algorithm proposed in this book; perform quite well during overloaded conditions. The algorithm is truly dynamic as it can work with available number of processors. 60 pp. Englisch.

Condición: New. Dieser Artikel ist ein Print on Demand Artikel und wird nach Ihrer Bestellung fuer Sie gedruckt. Autor/Autorin: Shah ApurvaDr Apurva Shah is working as Associate Professor at Faculty of Technology and Engineering, The M S University of Baroda. He has finished his Ph.D. in Computer Engineering from Sardar Patel University, Vallabh Vidyanagar, I.

Condición: New. Dieser Artikel ist ein Print on Demand Artikel und wird nach Ihrer Bestellung fuer Sie gedruckt. Autor/Autorin: Shah ApurvaDr Apurva Shah is working as Associate Professor with the Maharaja Sayajirao University of Baroda. He did his PhD in Computer Engineering from Sardar Patel University, India. His area of interest are Real-time Systems, Dis.

Condición: New. Dieser Artikel ist ein Print on Demand Artikel und wird nach Ihrer Bestellung fuer Sie gedruckt. Autor/Autorin: Shah ApurvaProf. Apurva Shah is working as Professor at G H Patel College of Engg & Tech, Vallabh Vidyanagar, India. Prof. Shah did his PhD from Sardar Patel University. He is having over 15 years of teaching experience. His research.

Taschenbuch. Condición: Neu. This item is printed on demand - Print on Demand Titel. Neuware -A scheduling algorithm schedules a set of tasks in such way that the tasks are completed before their deadlines reached. There are varieties of algorithms for scheduling of periodic tasks on multiprocessor under partitioning scheme or global scheduling scheme. The most common scheduling algorithms are: Rate Monotonic (RM), Deadline Monotonic (DM), Earliest Deadline First (EDF) and Least Laxity First (LLF). In this book, we have proposed a new algorithm titled as D_EDF which is modified conventional EDF algorithm. The proposed algorithm along with EDF, LLF, RM, DM algorithms are simulated and tested for independent, preemptive, periodic tasks on tightly coupled real-time multiprocessor system under global scheduling. From experiments and result analysis it concludes that the proposed algorithm is very efficient in both underloaded and overloaded conditions. The algorithm proposed in this book; perform quite well during overloaded conditions. The algorithm is truly dynamic as it can work with available number of processors.Books on Demand GmbH, Überseering 33, 22297 Hamburg 60 pp. Englisch.

Taschenbuch. Condición: Neu. This item is printed on demand - Print on Demand Titel. Neuware -Resource allocation is one of the challenging problems for real-time operating system. Priority inheritance protocol (PIP) and Priority ceiling protocol are very popular for resource allocation in real time operating system. Both algorithms have certain advantages and disadvantages. In priority inheritance protocol when any higher priority job is scheduled and if that job requires the resource which is acquired by lower priority job than lower priority job inherits the priority of currently scheduled job and it will be executed when context switch occurs.Generally context switching time taken by the processor is ignored but it is having considerable impact when numbers of switches are more. Our proposed algorithm will decrease the number of context switches as it will not schedule the job which requires the resource which is already acquired by another job. By this way, overall overhead of the system is reduced.Books on Demand GmbH, Überseering 33, 22297 Hamburg 56 pp. Englisch.

Taschenbuch. Condición: Neu. nach der Bestellung gedruckt Neuware - Printed after ordering - Resource allocation is one of the challenging problems for real-time operating system. Priority inheritance protocol (PIP) and Priority ceiling protocol are very popular for resource allocation in real time operating system. Both algorithms have certain advantages and disadvantages. In priority inheritance protocol when any higher priority job is scheduled and if that job requires the resource which is acquired by lower priority job than lower priority job inherits the priority of currently scheduled job and it will be executed when context switch occurs.Generally context switching time taken by the processor is ignored but it is having considerable impact when numbers of switches are more. Our proposed algorithm will decrease the number of context switches as it will not schedule the job which requires the resource which is already acquired by another job. By this way, overall overhead of the system is reduced.

Taschenbuch. Condición: Neu. nach der Bestellung gedruckt Neuware - Printed after ordering - A scheduling algorithm schedules a set of tasks in such way that the tasks are completed before their deadlines reached. There are varieties of algorithms for scheduling of periodic tasks on multiprocessor under partitioning scheme or global scheduling scheme. The most common scheduling algorithms are: Rate Monotonic (RM), Deadline Monotonic (DM), Earliest Deadline First (EDF) and Least Laxity First (LLF). In this book, we have proposed a new algorithm titled as D_EDF which is modified conventional EDF algorithm. The proposed algorithm along with EDF, LLF, RM, DM algorithms are simulated and tested for independent, preemptive, periodic tasks on tightly coupled real-time multiprocessor system under global scheduling. From experiments and result analysis it concludes that the proposed algorithm is very efficient in both underloaded and overloaded conditions. The algorithm proposed in this book; perform quite well during overloaded conditions. The algorithm is truly dynamic as it can work with available number of processors.

Taschenbuch. Condición: Neu. Building Interactive Worlds | Designing immersive experiences for games, XR, and the metaverse (English Edition) | Apurva Shah (u. a.) | Taschenbuch | Englisch | 2025 | BPB Publications | EAN 9789365890273 | Verantwortliche Person für die EU: Libri GmbH, Europaallee 1, 36244 Bad Hersfeld, gpsr[at]libri[dot]de | Anbieter: preigu Print on Demand.

Taschenbuch. Condición: Neu. nach der Bestellung gedruckt Neuware - Printed after ordering - The book describes the research work done by author during his PhD. It is suitable as reference book in the advance course of real-time system as well as for the researchers in the same field. It discusses the scheduling problem for real-time operating systems. Dynamic scheduling algorithms can not perform well during overloaded condition. The objective of the book is to get optimum performance in underloaded condition and to improve the performance of real-time systems in overloaded conditions. Initially, new algorithms are proposed with modifications in the conventional EDF algorithm. Then, ACO based dynamic scheduling algorithm for real-time operating systems has been proposed.An adaptive scheduling algorithm is also proposed as pure ACO based algorithm takes more time for execution. All algorithms are tested on single processor system, tightly coupled multiprocessor system and loosely coupled multiprocessor real-time systems. The book covers an important application of ACO in real-time scheduling.

Taschenbuch. Condición: Neu. nach der Bestellung gedruckt Neuware - Printed after ordering - DESCRIPTIONThe metaverse is a collective virtual shared space, created through the convergence of virtually enhanced physical reality and persistent virtual spaces. This book serves as your guide to building these immersive digital worlds, where users can interact with each other and digital objects in real-time.This book provides a clear guide for developers, designers, and enthusiasts to create immersive, interactive worlds. It covers essential concepts like interaction loops, immersion, and presence, along with practical steps for designing 3D environments, animating characters, and incorporating spatial audio. You will also explore cutting-edge tools like VR, AR, and AI to build engaging experiences while exploring key topics like blockchain, virtual economies, and digital ethics. By combining foundational concepts with hands-on examples, this book helps you create immersive experiences across games, XR, and the metaverse. Blending theory with practical advice equips you with the skills needed to design and develop interactive worlds that advance human-computer interaction.By the end of this book, you will be well-equipped to contribute meaningfully to the metaverse. You will understand the technical aspects of designing interactive experiential worlds, possess hands-on skills for creating engaging content, and be prepared to navigate the complex social and economic landscape of the metaverse.WHAT YOU WILL LEARN¿ A design framework for creating 3D interactive experiences.¿ Creating immersive spaces and engaging avatars that interact in diverse scenarios.¿ Explore modalities for engaging with this content, whether it be screen based, VR, or AR.¿ Learn what it takes to launch interactive experiential experiences and attract users.¿ Discuss metaverse business opportunities with legal and social implications of the technology.¿ Learn about generative worlds that leverage generative AI in virtual worlds.WHO THIS BOOK IS FORThe content in this book is targeted toward metaverse builders, designers, developers, product managers, brand teams, and most importantly self-taught creators of user-generated content (UGC). No prior knowledge of creating interactive worlds is required.