Skip to main content

[Raspberry Pi/ RASP] Formatting an SD card but stuck?

Thanks for Google again.
http://kevintechnology.com/post/29649230627/formatting-an-sd-card-for-the-beagleboardxmbone

Briefly talking about the situation:
There is a script in Raspberry official support webstie named mkcard.txt, which can be downloaded here: http://elinux.org/RPi_Advanced_Setup
However, even you use a brand-new SD card to prepare the Angstrom and Boot distribution of Linux, you may receive the following error:
/dev/sdd2 is apparently in use by the system; will not make a filesystem

*sdd2 is the partition I have in my sdcard.

There are two problems to be solved:
  1. We first need to remove the stolen devices from dmsetup:
    sudo dmsetup remove sdd1,  sudo dmsetup remove sdd2, etc.
  2. Comment out the line 36-38 in mkcard.txt to disable kpartx
Then you can run mkcard.txt again, everything is fine now.

Comments

Post a Comment

Popular posts from this blog

RSB+RTEMS 5/6 with QEMU-SMP (ARM realview_pbx_a9_qemu as example)

Since I got a request regarding this blog  written in 2016, summarizing again the complete flow with the latest version of RTEMS could be a good idea. Prepare a suitable workspace according to the adopted operating system on your host ( https://docs.rtems.org/branches/master/user/hosts/index.html ):  sudo apt-get build-dep build-essential gcc-defaults g++ gdb git unzip pax bison flex texinfo unzip python3-dev libpython-dev libncurses5-dev zlib1g-dev Checkout RSB and build: git clone git://git.rtems.org/rtems-source-builder.git rsb change directory to rsb/rtems/ and type ../source-builder/sb-set-builder --prefix=<the path you like to store the built toolchains> <the name of bsp> For example, to use QEMU, I need toolchains for ARM, so: ../source-builder/sb-set-builder --prefix=/home/kh.chen/respository/build/. 6/rtems-arm This will take a while. Please ensure your connection is reliable. Add the built folder into your PATH. For example, you can add one line in ~/.bas...
Post a Comment
Read more

[Gem5] Full system Simulation with Official Kernel

I follow the youtube provided by Gem5 to get the inspiration. (http://gem5.org/Running_gem5#Full_System_.28FS.29_Mode) I download the file here: http://www.gem5.org/dist/current/arm/ with http://www.gem5.org/dist/current/arm/aarch-system-20170616.tar.xz Then Set up M5_PATH as the place I extract the files: "/home/khchen/full_system_images/" If the setting is correct, assigning the disk-image will finish the rest of setting for dtb and kernel specifications. So far I can only use this img (aarch32-ubuntu-natty-headless.img) as my disk-image to run up to the login interface of the ubuntu: build/ARM/gem5.opt configs/example/fs.py --disk-image=/home/khchen/full_system_images/disks/aarch32-ubuntu-natty-headless.img With the other imgs, for example like "aarch64-ubuntu-trusty-headless.img", I think the kernel and the dtb should be given manually, because it will automatically load something with aarch32 prefix which doesn't make sense: info: kernel ...
Post a Comment
Read more

Efficient Computation of Deadline-Miss Probability and Potential Pitfalls

Fortunately, I will attend the DATE 2019 conference to present my work. The title of my work is: Efficient Computation of Deadline-Miss Probability and Potential Pitfalls This work is regarding the approximation of Deadline-Miss probability for soft real-time systems. The abstract is as the following: In soft real-time systems, rare deadline misses are often tolerable by the applications. Towards this, probabilistic arguments and analyses are applicable to the timing analyses of this class of systems, as demonstrated in many existing researches. Convolution-based analyses allow to derive tight deadline-miss probabilities, but suffer from a high time complexity. Among the analytical approaches, which result in a significantly faster runtime than the convolution-based approaches, the Chernoff bounds provide the tightest results. In this paper, we show that calculating the deadline-miss probability using Chernoff bounds can be solved by considering an equivalent convex optimization ...
Post a Comment
Read more