Skip to main content

Smart Grids and Energy Storage Systems

Smart Grids and Energy Storage Systems: Powering the Future of Energy In today’s rapidly evolving energy landscape, the push towards sustainability, efficiency, and reliability is stronger than ever. Traditional power grids, though robust in their time, are no longer sufficient to meet the demands of a modern, digital, and environmentally conscious society. This is where smart grids and energy storage systems (ESS) come into play — revolutionizing how electricity is generated, distributed, and consumed. What is a Smart Grid? A smart grid is an advanced electrical network that uses digital communication, automation, and real-time monitoring to optimize the production, delivery, and consumption of electricity. Unlike conventional grids, which operate in a one-way flow (from generation to end-user), smart grids enable a two-way flow of information and energy. Key Features of Smart Grids: Real-time monitoring of power usage and quality. Automated fault detection and rapid restoration. Int...

Operating system operation

1. modern operating systems are interrupt driven. If there are no processes to execute, no I/O devices to service, and no users to whom to answer, an operating system will sit quietly, waiting for something to happen.
2. A trap is a software-generated interrupt caused either by an error or by a particular request from a user program that an operating-system service is performed.
3. The interrupt-driven nature of an operating system defines system's general structure. For each type of interrupt, separate segments of codes in the operating system determine what action should be taken. An interrupt service routine is provided that is the responsible for dealing with the interrupt.
4. The operating system and the users share the hardware and software resources of the computer system, we need to make sure that an error in a user program could cause problem only for the one program that was running. With sharing, many processes could be adversely affected by a bug in one program. For example, if a process gets stuck in an infinite loop, this loop prevents the correct operation of many other processes.
5. Without protection against these sorts of errors, either the computer must execute only one process at a time or all output must be suspect.
Dual-mode operation:
     Dual-mode operation allows Operation system to guard itself and the other system components User mode and kernel
 mode.
     Some instructions designated as authority, only executable in kernel mode System call changes mode to kernel, return from call resets it to user
Transition from User to Kernel Mode
* Timer to prevent infinite loop / process monopolize resources Set interrupt after specific period
* Operating system decrements counter
* When counter zero generate an interrupt
* Set up before scheduling process to recover control or terminate program that exceeds allotted time.
          If a computer system has multiple users and allows the concurrent execution of multiple processes, then access to data must be regulated. For that purpose, mechanisms ensure that files, memory segments, CPU, and other resources can be operated on by only those processes that have gained proper consent from the operating system.
Protection and security
          Protection is any mechanism for controlling the availability of processes or users to the resources defined by a 
computer system. This mechanism must provide means for specification of the controls to be resist and means for enforcement.
          Protection can improve accuracy by detecting latent errors at the interfaces between component subsystems. Early detection of interface errors can often prevent polluting of a healthy subsystem by another subsystem that is malfunctioning. 
          An unprotected resource cannot defend against use (or misuse) by an unauthorized or incompetent user. A protection-oriented system provides a means to distinguish between authorized and unauthorized usage, A system can have sufficient protection but still be prone to failure and allow inappropriate access.
          It is the job of security to protect a system from external and internal attacks. Such attacks spread across a huge range and include viruses and worms, denial-of service attacks Protection and security 
require the system to be able to differentiate among all its users. Most operating systems maintain a list of 
user names and related user identifiers (user IDs).
* User ID then declarative with all files, processes of that user to determine access control
* Group identifier (group ID) allows set of users to be defined and controls managed, then also associated with each process, file Privilege incision allows user to change to effective ID with more rights
Kernel Data Structures:
          The operating system must keep a lot of information about the current situation of the system. As things happen within the system these data structures must be changed to contain the current reality. For example, a new process might be created when a user logs onto the system. 
     The kernel must create a structure of the data representing the new process and link it with the data structures representing all of the other processes in the system.
          Mostly these data structures exist in physical memory and are attainable only by the kernel and its subsystems. Data structures retain data and pointers, addresses of other data structures, or the 
addresses of routines. Taken all together, the data structures used by the Linux kernel can look very difficult. Every data structure has a purpose and although some of them are used by several kernel subsystems, they are more easy than they appear at first sight.
          Understanding the Linux kernel pivot on understanding its data structures and the use that the various functions within the Linux kernel makes of them. This section bases its description of the Linux kernel on its data structure. It briefs about each kernel subsystem in terms of its algorithms, which are its 
methods of getting things done, and the usage of the kernel's data structures.


Popular posts from this blog

Abbreviations

No :1 Q. ECOSOC (UN) Ans. Economic and Social Commission No: 2 Q. ECM Ans. European Comman Market No : 3 Q. ECLA (UN) Ans. Economic Commission for Latin America No: 4 Q. ECE (UN) Ans. Economic Commission of Europe No: 5 Q. ECAFE (UN)  Ans. Economic Commission for Asia and the Far East No: 6 Q. CITU Ans. Centre of Indian Trade Union No: 7 Q. CIA Ans. Central Intelligence Agency No: 8 Q. CENTO Ans. Central Treaty Organization No: 9 Q. CBI Ans. Central Bureau of Investigation No: 10 Q. ASEAN Ans. Association of South - East Asian Nations No: 11 Q. AITUC Ans. All India Trade Union Congress No: 12 Q. AICC Ans. All India Congress Committee No: 13 Q. ADB Ans. Asian Development Bank No: 14 Q. EDC Ans. European Defence Community No: 15 Q. EEC Ans. European Economic Community No: 16 Q. FAO Ans. Food and Agriculture Organization No: 17 Q. FBI Ans. Federal Bureau of Investigation No: 18 Q. GATT Ans. General Agreement on Tariff and Trade No: 19 Q. GNLF Ans. Gorkha National Liberation Front No: ...

Operations on data structures

OPERATIONS ON DATA STRUCTURES This section discusses the different operations that can be execute on the different data structures before mentioned. Traversing It means to process each data item exactly once so that it can be processed. For example, to print the names of all the employees in a office. Searching It is used to detect the location of one or more data items that satisfy the given constraint. Such a data item may or may not be present in the given group of data items. For example, to find the names of all the students who secured 100 marks in mathematics. Inserting It is used to add new data items to the given list of data items. For example, to add the details of a new student who has lately joined the course. Deleting It means to delete a particular data item from the given collection of data items. For example, to delete the name of a employee who has left the office. Sorting Data items can be ordered in some order like ascending order or descending order depending ...

Points to Remember

• A data structure is a particular way of storing and organizing data either in computer’s memory or on the disk storage so that it can be used efficiently. • There are two types of data structures: primitive and non-primitive data structures. Primitive data structures are the fundamental data types which  are supported by a programming language. Non-primitive data structures are those data structures which are created using primitive data structures. • Non-primitive data structures can further be classified into two categories: linear and non-linear data structures.  • If the elements of a data structure are stored in a linear or sequential order, then it is a linear data structure. However, if the elements of a data structure are not stored in sequential order, then it is a non-linear data structure.  • An array is a collection of similar data elements which are stored in consecutive memory locations. • A linked list is a linear data structure consisting of a grou...