what is the relation between processes and threads? what determines the number of processes and threads?
212400
first b/w an exe and a process...the difference is not much except that an exe is essentially a file of executable machine code resting on ur hard disk statically....where as a process is those same bits and bytes doing there rounds in the processor and the RAM i.e the exe is now being executed.\n\na process is a whole machine code which is being executed as in a whole complete progam which can have multiple instances e.g. two internet explorers opening different webpages they would be two entirely different processes executing the same machine code...\n\na thread on the other hand is a part of a process(process within a process executing a specific task) for example take a process that is supposed to do multitasking mmmm...let's say u call up a customer service desk...now somebody else too calls up after a sec u make the call now both of u hear the same voice prompts ...all this is handled by the same application or process that is being executed what i mean to say is that the other caller does not have to wait while u get through with ur stuff i.e. the program is over with u...another example will be say in a webpage there is a timer running also there is an ad being displayed ....both are different threads supposed to perform different actions but they are essentially a part of the single process that owns them....\n\nhope this gives u a clear picture\nas for the number of process and threads are determined by the programmer for the latter and the OS or the user in the former case\n\nbye...
592286
teraflop\nA trillion floating point operations per second \n10 to the 12th power floating-point operations per second \n2 to the 40th power flops \n\nGHz\n1 billion cycles per second.\n\nEach computer instruction requires a fixed number of cycles, so the clock speed determines how many instructions per second the microprocessor can execute
337577
Sounds like something running in the background....I dont know why people insist on running programs they aint using! They hog system rescources, mainly ram! Ram is an area of memory that does the actual running of your software. To make it simple....say you have 128 megs of ram. You have a game that requires 64 megs to run...you also have weatherbug, yahoo messenger, and god knows whatelse also sharing this ram and using another 100 megs. What do you suppose happens? CLOSE ALL that bullshit down! Stop some of that crap from running on startup! You will be MUCH happier with the way your system runs!
212811
Basically you'll need to open a port on each of the two processes, and send a packet between them to communicate.  Generally that will be structured as a sending/"talking" process and a "listening" process to catch the sent packet. In C, you'll need to check the library for the operating system and compiler you're using to find the appropriate functions.  Look under "low level IO", usually.
121442
I have a couple of suggestions.  First, I'd install a local FTP server to make sure that the problem really is in the code and not in the speed of your network.  I've included a link to one server below, but you can find others using your favorite search engine.\n\n500MB seems like a very small amount of data.  Are you sure you want to use multi-threading?  Could you start multiple copies of your program?  If you decide to go with threading, I'd upgrade to Visual Basic 2005 if you don't have it already - I included a link to the free version below.\n\nIn VB2005, there's a new component for threading called BackgroundWorker.  I've linked to one example of it's use below -- but MSDN has a lot of material on it, including examples.
469289
implementing process is allready started
300038
To solve, one needs to know the length of the thread.
650616
Multiple threads can be executed in parallel on many computer systems. This multithreading generally occurs by time slicing, wherein a single processor switches between different threads--in which case the processing is not literally "simultaneous", for the single processor is only really doing one thing at a time (though this switching can happen so fast as to give the illusion of simultaneity). On a multiprocessor system, threading can be achieved via multiprocessing, wherein different threads can run simultaneously on different processors.\n\nMany modern operating systems directly support both time-sliced and multiprocessor threading with a process scheduler. The operating system kernel allows programmers to manipulate threads via the system call interface. Some implementations are called a kernel thread, whereas a lightweight process is a specific type of kernel thread that shares the same state and information.\n\nAbsent that, programs can still implement threading by using timers, signals, or other methods to interrupt their own execution and hence perform a sort of ad hoc time-slicing. These are sometimes called user-space threads.\n\nAn unrelated use of the term thread is for threaded code, which is a form of code consisting entirely of subroutine calls, written without the subroutine call instruction, and processed by an interpreter or the CPU. Two threaded code languages are Forth and early B programming languages.\nMultithreading is a popular programming and execution model that allows multiple threads to exist within the context of a single process, sharing the process' resources but able to execute independently. The threaded programming model provides developers with a useful abstraction of concurrent execution. However, perhaps the most interesting application of the technology is when it is applied to a single process to enable parallel execution on a multiprocessor system.\n\nThe term multiprocessing is sometimes used to refer to the execution of multiple concurrent software processes in a system as opposed to a single process at any one instant. However, the term multiprogramming is more appropriate to describe this concept, which is implemented mostly in software, whereas multiprocessing is more appropriate to describe the use of multiple hardware CPUs. A system can be both multiprocessing and multiprogramming, only one of the two, or neither of the two.
252845
i have used a lot of processes in my current job.  I have used successful processes to create safety programs and human resource programs.  I am trying to learn as much as I can about each process but a lot of the learning just comes from experience.  For instance you learn that a process does not have to be done exactly the same as long as the end results are successful and the process still covers all the bases.
286367
I fear , by task manager , you can not see the virtula address of pages assigned to your process . \n\nSolution of your Problem :\n\nInstall windbg ( From Microsoft)\nAttach Process and symbols . I hope u are attaching user process .\n\nGive command !process 7\n\nsee your process in display\n\nit will also show threads corresponding to that process.\n\nWIth thread it will show .. Virtual page address alloted to threads corresponding to process.\n\nHow to convert virtual address into physical address\n\n!pfn < virtual address > ( something similar to pfn)\n\nit will give u physical address\n\n\nU can also look for other tools in sysinternals.com
136490
Synchronization just means that only one entity can access that chunk of code at a time.  So the entire chunk of code will get ran before another thread or process can step in and run that code again.  The difference between a block and method is just the scope or the length of the chunk of code that is synchronized.
306725
protected void BuildThread() \n{ \n  string s ; \n  s = "This is output from another thread"; \n  Console.WriteLine(s); \n}\n\nthread = new Thread(new \nThreadStart(BuildThread)); \nthread.Start();\n\nYou can kill a thread:\nif ( thread.IsAlive ) \n{ \n     thread.Abort(); \n}\n\nor you can suspend it:\nif (thread.ThreadState = ThreadState.Running) \n{ \n     thread.Suspend(); \n}\n\nWhat is your need for a thread?
587178
Unix Systems Programming: Communication, Concurrency and Threads, Second Edition (Hardcover) \n\nhttp://www.amazon.com/gp/product/0130424110/qid=1149662737/sr=1-1/ref=sr_1_1/102-6544606-0886529?s=books&v=glance&n=283155
451326
YAY a C question I can help with!!! I hope you know a little about programming tho..sorry.\n\nFirst of all num[index] is an array which have multiple variables in them right? The [ ] signify an array. You said that num[max] will have 20 variables (at most) at the top of the program but forget about that because it's doesn't serve a purpose in this prog. \n\nOK, I've gotta stop, looking at this program you've gotta lot of logical errors. But in essence you're asking the program to run the for loop until the index value in num[index] is equal to whatever the number is in count at the end...\n\nEmail me if you want some more help though!
634627
Jobs are run round robin until some fixed number of times. Then they are run only if their are no other jobs in the system.  Each process is run to a defined quanta limit in milli-seconds.\n\nA race condition occurs when the scheduling of two processes is so critical,  that the various orders of scheduling them result in different computations.\n\nA deadly embrace occurs when two processes are unknowingly waiting for resources that are held by each other and thus unavailable.\n\nThe scheduler simply does not schedule any job until all the necessary resources are available.\n\nSpecify all resources needed in advance except that the scheduler starts the job even when all of them are not immediately available. The concept here is to avoid allocating a resource to a job if there is any possibility of a deadly embrace.\n\nConstrain allocation to avoid deadly embrace.
195068
On an SMP system, Inter Processor Interrupts are used to coordinate with other processors. Is this what you are asking about?
271196
In paging, pages of a size keep moving in and out of the memory according to demand( if you are using demand paging)... But the user view of a memory is hardly like that(progrms divided into pages... few people will buy that). So we use paging with segmentation which allows us to employ the view we have had of memory... of it being segmented in code,global variables,parameters etc. So a page eventually does not belong to a process but a segment of a process... one more advantage is that we can further exploit the locality of reference property of programs.