Search Results

Search found 2456 results on 99 pages for 'atomic swap'.

Page 46/99 | < Previous Page | 42 43 44 45 46 47 48 49 50 51 52 53  | Next Page >

• Update Manager Partitions

  - by user170585

  Perhaps this is completely stupid, but here's my inquiry: I have Ubuntu 12.04 installed on an external hard drive. On that HD there are 4 partitions. Two for operating systems, two for swap (unnecessary but I like it that way). The actual computer itself has Windows 7. If I use the Update manager to update to 12.10 or even 13.04, would the new Ubuntu install itself on the same partition it already was on? The other operating system I'm running on the Hard Drive is Lubuntu, for when I need to run Linux on older computers, if that matters. Thanks, Adam

  Read the article

• In setting up dual Boot with Windows XP and Ubuntu, which OS do I install first?

  - by markl

  I'd like to install both Ubuntu 12.04 and Windows XP on a Dell laptop, and I was thinking about using a dual boot structure, and using the bulk of my hard drive as empty hard drive space to share files between the two operating systems (so choice of file system type is very important in this set-up). The kind of partitioning structure I would like to use is Partition 1 - Ubuntu 12.04 (root) (20GB) Partition 2 - Ubuntu /home (20GB) Partition 3 : Free Space (560GB) Partition 4 : Windows XP (35GB) Partition 5 : SWAP (3GB) (Total Hardrive Capacity is ~640GB) My question is; what is the best way to go about setting up this kind this system? Should I install Windows XP first and setup the partitions, and then install Ubuntu which I believe will install the GRUB bootloader for OS booting choice or Do I install Ubuntu first, setting up the available partitions and then perform a WIndows install? Please let me know if there is anything in this setup that I have left out and should know about, including things related to setting particular partitions as logical or primary, and whether the boot partition and the filesystem partition should actually be two separate partitions.

  Read the article

• Fix grub2 after installing ubuntu 12.04

  - by user80039

  I've installed ubuntu 12.04, but after rebooting I get the message: GRUB loading: Welcome to GRUB! error: file '/grub/i386-pc/normal.mod' not found Entering rescue mode... grub rescue> I have the following partitons setup: /dev/sda6: /boot ext2 /dev/sda9: / ext4 /dev/sda8: swap /dev/sda7: /home ext4 I guess that some of the prefixes for GRUB are wrong due to the /boot partition? Or there might be a problem with EFI? The hardware is a 1015bx asus netbook with c-60 amd fusion chipset. How can I fix this GRUB problem from the rescue prompt?

  Read the article

• resizing partitions

  - by venetin

  I have the following configuration: sda1 1 GB maybe fat32 (windows recovery partition) sda2 40 GB ntfs(windows drive c) with boot flag sda3 around 100GB ntfs(storage partition) sda4 extended partition:sda5 10 GB ext4 partition sda6 1 GB linux swap I want to make this changes: sda2 30 GB resize(decrease size with 10 GB) sda3 around 100GB(move and maybe decrease size with 4-5 GB) sda4 around 20-22 GB (move and increase size with 10-15GB) sda5 around 20 GB (move and increase size with 10-12 GB) sda6 2 GB (move and increase size with 1 GB) Is it safe to do this operations?Will i lose grub? I will do the changes with gparted on puppy linux live usb. Thanks

  Read the article

• Clean install of 12.04 won't boot from HDD

  - by MarchingKazoo

  Downloaded 12.04.2. Made CD. Machine boots from CD as expected. Installed onto HD. Upon reboot, "Read error" message appears. Upon booting from CD, the HD appears as expected: One partition for Ubuntu, taking up about 12 gig, the rest empty. Lather, rinse, repeat five times. Results of "sudo fdisk -l": Disk /dev/sda: 200.0 GB, 200049647616 bytes 255 heads, 63 sectors/track, 24321 cylinders, total 390721968 sectors Units = sectors of 1 * 512 = 512 bytes Sector size (logical/physical): 512 bytes / 512 bytes I/O size (minimum/optimal): 512 bytes / 512 bytes Disk identifier: 0x000dfa3e Device Boot Start End Blocks Id System /dev/sda1 * 2048 386596863 193297408 83 Linux /dev/sda2 386598910 390721535 2061313 5 Extended /dev/sda5 386598912 390721535 2061312 82 Linux swap / Solaris Should this be complicate? Seems no.

  Read the article

• Recovering a deleted partition after installing Ubuntu?

  - by al akhfiya

  I have a serious problem. I Installed Ubuntu 13.04 on my Laptop. I format all partitions (Windows)/(Erase all data and Install Ubuntu):( . How do I recover my accidentally lost Windows partitions after installing Ubuntu?. I try using PartitionWizard and Testdisk. But cannot recovery partition, Partitionwozard and Testdisk only detected the linux partition (Linux/Ext4 and Linux/Swap). I hope the answer. Please help. and Sorry for my English is not good. Thanks :)

  Read the article

• How to resize(increase) a root+home cloned partition from a smaller hdd?

  - by saulo

  Here is my story: I had a hd failing so I cloned it with dd to larger 500gb hd. It seemed to have worked well, but I have all this unallocated free space at the end of the disk (230gb). I tried to used gparted from a liveUSB to allocate all this space to my root+home partition (other than that I only have a small extended partition with the swap). It won't let me do this. I can only create another partition, or allocate the free space to the extend partition. I can however reduce the size of the root+home partition since I wasn't using all the space Is there a way to put this free space to my root+home partition after all? Or do I have to go with another partition. If so I'd like to separate my home from the root, reduce the root partition and create a ext4 logical home partition. What would be the best safest way to do this? Thanks so much in advance, aloha

  Read the article

• Grub cannot boot Windows 7 loader entry on 3tb drive

  - by twicejr

  It fails and it says 'cannot find device'. It will work again if I reinstall Windows, and use something like EasyBCD. But I'd like grub as a loader only, can someone help me out here? My system has a regular BIOS (p35-ds4 mainboard) so no UEFI support. Previously ran Windows 8 alongside ubuntu 13.04, now wanted windows 7 again with ubuntu 13.10. I am using disk /dev/sda. 3000.6 GB, 3000591900160 bytes 255 head, 63 sectors/track, 364801 cylinders, 5860531055 sectors Sector size (logical/fysical): 512 bytes / 4096 bytes Device Begin End Blocks ID System /dev/sda1 2048 419432447 209715200 83 Linux /dev/sda2 419432448 436013055 8290304 82 Linux swap /dev/sda3 436015102 1576339455 570162177 5 extended Partition 3 does not start on a fysical sector limit. /dev/sda4 * 1576339456 5860530175 2142095360 7 HPFS/NTFS/exFAT /dev/sda5 436015104 855443455 209714176 7 HPFS/NTFS/exFAT /dev/sda6 855445504 1576339455 360446976 7 HPFS/NTFS/exFAT

  Read the article

• Fine-grained permissions on SVN Repository

  - by Jim

  Hello, I'm trying to setup a SVN repo for a whole bunch of users. Different users need to have different levels of access to areas of the repository. A trivial example might be that frontend engineers need access to the "view" and "controllers" but not "model", while backend engineers need access to the "controllers" and "model" but not "view". It needs to be one repository, because (as far as I know) that's the only way to ensure that commits touching multiple modules are atomic. Is there a fine-grained way to control user access to a repository? Thanks!

  Read the article

• replace file with hardlink to another file atomically

  - by Ben Clifford

  I have two directory entries, a and b. Before, a and b point to different inodes. Afterwards, I want b to point to the same inode as a does. I want this to be safe - by which I mean if I fail somewhere, b either points to its original inode or the a inode. most especially I don't want to end up with b disappearing. mv is atomic when overwriting. ln appears to not work when the destination already exists. so it looks like i can say: ln a tmp mv tmp b which in case of failure will leave a 'tmp' file around, which is undesirable but not a disaster. Is there a better way to do this? (what I'm actually trying to do is replace files that have identical content with a single inode containing that content, shared between all directory entries)

  Read the article

• Ruby on Rails protect_from_forgery best practice

  - by randombits

  I'm currently working on building a RESTful web api with ruby on rails. I haven't bothered putting a proper authentication scheme into the API yet as I'm ensuring that tests and the basic behavior of the API is working all locally first. Upon testing non-HTTP GET type requests such as HTTP POST/DELETE/PUT, stuff chokes because protect_from_forgery is on by default. How does this work when I'm working in practice since essentially the idea is in a RESTful API that there is no state. The client does not have a session or a cookie associated with the server. Each request is an atomic, self-executed request. The user will supply some credentials to ensure they are who they say they are, but other than that, does protect_from_forgery make sense at this point? Should it remain enabled?

  Read the article

• Lock Free Queue -- Single Producer, Multiple Consumers

  - by Shirish

  Hello, I am looking for a method to implement lock-free queue data structure that supports single producer, and multiple consumers. I have looked at the classic method by Maged Michael and Michael Scott (1996) but their version uses linked lists. I would like an implementation that makes use of bounded circular buffer. Something that uses atomic variables? On a side note, I am not sure why these classic methods are designed for linked lists that require a lot of dynamic memory management. In a multi-threaded program, all memory management routines are serialized. Aren't we defeating the benefits of lock-free methods by using them in conjunction with dynamic data structures? I am trying to code this in C/C++ using pthread library on a Intel 64-bit architecture. Thank you, Shirish

  Read the article

• (Google AppEngine) Memcache Lock Entry

  - by Friedrich

  Hi, i need a locking in memcache. Since all operations are atomic that should be an easy task. My idea is to use a basic spin-lock mechanism. So every object that needs locking in memcache gets a lock object, which will be polled for access. // pseudo code // try to get a lock int lock; do { lock = Memcache.increment("lock", 1); } while(lock != 1) // ok we got the lock // do something here // and finally unlock Memcache.put("lock", 0); How does such a solution perform? Do you have a better idea how to lock a memcache object? Best regards, Friedrich Schick

  Read the article

• Terminate long running thread in thread pool that was created using QueueUserWorkItem(win 32/nt5).

  - by Jake

  I am programming in a win32 nt5 environment. I have a function that is going to be called many times. Each call is atomic. I would like to use QueueUserWorkItem to take advantage of multicore processors. The problem I am having is I only want to give the function 3 seconds to complete. If it has not completed in 3 seconds I want to terminate the thread. Currently I am doing something like this: HANDLE newThreadFuncCall= CreateThread(NULL,0,funcCall,&func_params,0,NULL); DWORD result = WaitForSingleObject(newThreadFuncCall, 3000); if(result == WAIT_TIMEOUT) { TerminateThread(newThreadFuncCall,WAIT_TIMEOUT); } I just spawn a single thread and wait for 3 seconds or it to complete. Is there anyway to do something similar to but using QueueUserWorkItem to queue up the work? Thanks!

  Read the article

• Core Data store corruption

  - by sehugg

  A handful of customers for my iPhone app are experiencing Core Data store corruption (I assume so, since the error is "Failed to save to data store: Operation could not be completed. (Cocoa error 259.)") Has anyone else experienced this kind of store corruption? I am worried since I aim to soon push an update which performs a schema migration, and I am worried that this will expose even more problems. I had assumed that the Core Data/SQLlite APIs use atomic operations and are immune to corruption except if the underlying filesystem experiences corruption. Is there a way to reduce/prevent corruption, or at least a good way to reproduce (I have been unsuccessful thus far).

  Read the article

• How is thread synchronization implemented, at the assembly language level?

  - by Martin

  While I'm familiar with concurrent programming concepts such as mutexes and semaphores, I have never understood how they are implemented at the assembly language level. I imagine there being a set of memory "flags" saying: lock A is held by thread 1 lock B is held by thread 3 lock C is not held by any thread etc But how is access to these flags synchronized between threads? Something like this naive example would only create a race condition: mov edx, [myThreadId] wait: cmp [lock], 0 jne wait mov [lock], edx ; I wanted an exclusive lock but the above ; three instructions are not an atomic operation :(

  Read the article

• How to improve my LDAP schema?

  - by asmaier

  Hello, I have a OpenLDAP Database and it holds some project objects that look like dn: cn=Proj1,ou=Project,ou=ua,dc=org cn: Proj1 objectClass: top objectClass: posixGroup member: 001ag member: 002ag System: ABEL System: PCx Budget: ABEL:1000000:0.3 Budget: PCx:300000:0.3 One can see that the Budget attribute is a ":"-separated string, where the first part holds the name of the system the budget is for, the second part holds some budget (which may change every month) and the last entry is a conversion factor for the budget of that system. Seeing this, I thought this is bad database design, since attribute values should always be atomic. But how can I improve that in LDAP, so that I can do a direct ldapsearch or a direct ldapmodify of the budget of System "ABEL" instead of writing a script, that will have to parse and split the ":"-separated string?

  Read the article

• R: ggplot2, how to add a number of layers to a plot at once to reduce code

  - by John

  library(ggplot2) This code produces a nice looking plot: qplot(cty, hwy, data = mpg, colour = displ) + scale_y_log2() + labs(x="x axis") + labs(y="y axis") + opts(title = "my title") But I want to setup variables to try and to reduce code repetition: log_scale <- scale_y_log2() xscale <- labs(x="x axis") yscale <- labs(y="y axis") title <- opts(title = "my title") my_scales <- c(log_scale, xscale, yscale, title) # make a variable to hold the scale info changes above So that I can do this and add a bunch of things at the same time: qplot(cty, hwy, data = mpg, colour = displ) + my_scales # add these to your plot. but I get this error: Error in object$class : $ operator is invalid for atomic vectors I realize that the things going into my_scales need to be layers / different types of objects, but I don't see what they should be.

  Read the article

• Multithreading and booleans

  - by Ikaso

  Hi Everyone, I have a class that contains a boolean field like this one: public class MyClass { private boolean boolVal; public boolean BoolVal { get { return boolVal; } set { boolVal = value; } } } The field can be read and written from many threads using the property. My question is if I should fence the getter and setter with a lock statement? Or should I simply use the volatile keyword and save the locking? Or should I totally ignore multithreading since getting and setting boolean values atomic? regards,

  Read the article

• nested page-faulting of user-space address in Linux

  - by shankar

  Hi, I would like to know if it is functionally wrong to page-fault a user-space address when kernel is running fault-handler to bring in a user-page. OS is Linux 2.6.30 Assume that both user-addresses are valid ( falling within vma , rw permission ) for the task. When I check the kernel code, i find that the kernel does not mind the nested fault if the faulted-addresses are valid and the fault did not occur in atomic-context or in irq handler. (I dont think the answer is cpu-specific, but I would add that i am interested in arm and mips ). eg : The scenario can happen if I print stack-data from page-fault handler. thanks shankar

  Read the article

• In MS SQL Server, is there a way to "atomically" increment a column being used as a counter?

  - by Dan P

  Assuming a Read Committed Snapshot transaction isolation setting, is the following statement "atomic" in the sense that you won't ever "lose" a concurrent increment? update mytable set counter = counter + 1 I would assume that in the general case, where this update statement is part of a larger transaction, that it wouldn't be. For example, I think this scenario is possible: update the counter within transaction #1 do some other stuff in transaction #1 update the counter with transaction #2 commit transaction #2 commit transaction #1 In this situation, wouldn't the counter end up only being incremented by 1? Does it make a difference if that is the only statement in a transaction? How does a site like stackoverflow handle this for its question view counter? Or is the possibility of "losing" some increments just considered acceptable?

  Read the article

• Is it possible to create thread-safe collections without locks?

  - by Andrey

  This is pure just for interest question, any sort of questions are welcome. So is it possible to create thread-safe collections without any locks? By locks I mean any thread synchronization mechanisms, including Mutex, Semaphore, and even Interlocked, all of them. Is it possible at user level, without calling system functions? Ok, may be implementation is not effective, i am interested in theoretical possibility. If not what is the minimum means to do it? EDIT: Why immutable collections don't work. This of class Stack with methods Add that returns another Stack. Now here is program: Stack stack = new ...; ThreadedMethod() { loop { //Do the loop stack = stack.Add(element); } } this expression stack = stack.Add(element) is not atomic, and you can overwrite new stack from other thread. Thanks, Andrey

  Read the article

• Synchronisation construct inside pragma for

  - by Sayan Ghosh

  Hi, I have a program block like: for (iIndex1=0; iIndex1 < iSize; iIndex1++) { for (iIndex2=iIndex1+1; iIndex2 < iSize; iIndex2++) { iCount++; fDist =(*this)[iIndex1].distance( (*this)[iIndex2] ); m_oPDF.addPairDistance( fDist ); if ((bShowProgress) && (iCount % 1000000 == 0)) xyz_exception::ui()->progress( iCount, (size()-1)*((size()-1))/2 ); } } } } I have tried parallelising the inner and outer loop and by putting iCount in a critical region. What would be the best approach to parallelise this? If I wrap iCount with omp single or omp atomic then the code gives an error and I figured out that would be invalid inside omp for. I guess I am adding many extraneous stuffs to paralellise this. Need some advice... Thanks, Sayan

  Read the article

• Where are the really high quality and complex Swing components?

  - by jouhni

  Looking at Swing, I have the feeling that it comes with many useful and reasonable atomic components in its core. And when I look at the Web there are hundrets of quickly plugged together components (among them many date/time pickers, pimped lists and tables), which have in common that I could easily write them on my own, if I needed them. When I build big software and come to the point where I need a domain-specific component which is really big, I mostly come to the point where I have to write it on my own, which, due to the point that they are not just plugged together lists and tables, isn't done qickly. So, the question is, why are there no Swing component galleries which contain more than just customized date/time pickers or lists with added tree support. Where are the components which really raise the level of abstraction, or are in best case domain-specific?

  Read the article

• MSDTC Distributed Transaction Coordinator Enabling

  - by Curtis White

  I've a web server and a separate SQL server. I'm trying to use transaction scope to ensure that SQL queries are completed with my linq queries. I wrap everything with this using (TransactionScope scope = new TransactionScope()) I want to know where I need to install DTC. Do I need to install it on the IIS 7.5 box AND the SQL server? Do I need to unblock some ports? Are there any security risk in doing so? I've setup this up once before but don't remember how. If I can't get access to DTC then is there any other way to ensure a lINQ and sql query is atomic?

  Read the article

< Previous Page | 42 43 44 45 46 47 48 49 50 51 52 53  | Next Page >