日历

« 2008-05-17  
    123
45678910
11121314151617
18192021222324
25262728293031

最新评论

统计信息

  • 访问量: 39827
  • 日志数: 28
  • 建立时间: 2006-04-08
  • 更新时间: 2008-05-17

RSS订阅

关注开源技术(黑龙江。哈尔滨) 倡导企业级开源应用,探索信息化方案标准; 集成开源众多新成果,消除开源方案忧与患; 力推低成本开源战车,笑纳八方来客叙开源; 普及开源知识助推力,喜迎开源企业展宏图;

我的最新日志

  • Calendar of Upcoming Conferences(2008)

    2008-5-17

    June 22–27, 2008, in Boston, MA, for the 2008 USENIX Annual Technical Conference. Leading researchers from around the globe are coming together to discuss their innovative systems research and cutting-edge practices.
    http://www.usenix.org/events/
        About USENIX

    USENIX Mission Statement

    USENIX, the Advanced Computing Systems Association:

        * Fosters technical excellence and innovation
        * Supports and disseminates research with a practical bias
        * Provides a neutral forum for discussion of technical issues
        * Encourages computing outreach into the community at large

    Since 1975, the USENIX Association has brought together the community of engineers, system administrators, scientists, and technicians working on the cutting edge of the computing world.

    The USENIX conferences have become the essential meeting grounds for the presentation and discussion of the most advanced information on the developments of all aspects of computing systems.

    USENIX supports its members' professional and technical development through a variety of on-going activities, including:

        * Member benefits
        * Annual technical and system administration conferences
        * Informal, specific-topic conferences such as security, internet technology, and mobile computing—as many as nine technical conferences per year
        * A highly regarded tutorial program
        * SAGE, a Special Interest Group for system administrators
        * Student programs that include stipends to attend conferences, low student member fees, a university outreach program, and best paper awards
        * Online library with proceedings from each USENIX conference and the magazine, ;login:
        * Participation in various ISO, IEEE and Open Group standards efforts
        * USENIX supports a "Good Works" program.
        * International Programs, including an International Affiliate Program. USENIX also co-sponsors conferences by international technical groups.
        * Two prestigious annual Awards which recognize public service and technical excellence: The Lifetime Achievement (Flame) Award and The Software Tools Users Group Award. SAGE sponsors the annual SAGE Outstanding Achievement Award recognizing outstanding achievement in system administration.
        * Membership in the Computing Research Association and The Open Group
  • java字节码反编译软件

    2008-4-27

    reJ

    The reJ project aims to allow improved visibility into Java class files, whether they were created compiling from Java sources, another language or by any other kind of tool. Basically anything that will run in a Java Virtual Machine.

    reJ is a library and a graphical tool for inspection (viewing, searching and comparing) and manipulation (modification, obfuscation, refactoring of methods, fields, attributes and code) of classfiles for the Java platform.

    http://rejava.sourceforge.net/

    rejava

  • Welcome to XtreemOS!

    2008-4-27

    Building and Promoting a Linux-based Operating System to Support Virtual Organizations for Next Generation Grids (2006-2010).

    http://www.xtreemos.eu/

    The emergence of Grids enables the sharing of a wide range of resources to solve large-scale computational and data intensive problems in science, engineering and commerce.
    While much has been done to build Grid middleware on top of existing operating systems, little has been done to extend the underlying operating systems to enablee and facilitate Grid computing, for example by embedding important functionalities directly into the operating system kernel.
    The XtreemOS project aims at investigating and proposing new services that should be added to current operating systems to build Grid infrastructure in a simple way. XtreemOS targets the Linux well-accepted open source operating system extending it to Grid with native support for virtual organizations. One of the most important challenges in XtreemOS is the identification of the basic functionalities which are to be embedded in the Linux kernel.

    A set of operating system services, extending those found in the standard Linux distribution, will provide Linux users with all the Grid capabilities associated with current Grid middleware, but fully integrated into the OS. The underlying Linux OS will be extended as needed to support virtual organizations spanning across many machines and to supply appropriate interfaces to Grid OS services.

    Installed on each participating machine (personal computer, cluster of workstations, mobile devices), the XtreemOS system will provide for the Grid what a traditional Operating System offers for a single computer: abstraction from the hardware and secure resource sharing between different users. It will thus considerably ease the work of users belonging to virtual organizations giving them the illusion of using a traditional computer, and releasing them from dealing with the complex resource management issues of a typical Grid environment.  By integrating Grid capabilities into the Linux kernel, XtreemOS will also provide a more robust, secure and easier-to-manage infrastructure for system administrators. This will be experimentally demonstrated with a set of real applications, provided by well-known industrial partners, that cover a large spectrum of application fields.

  • ETAPS 2008

    2008-4-25

      researchers working on topics relating to Software Science. ETAPS, established in 1998, is a confederation of five main annual conferences, accompanied by satellite workshops and other events. ETAPS 2008 is the eleventh event in the series.
      ETAPS 2008 will be hosted by Budapest, the capital of Hungary, which was founded in 1873 as the unification of the separate historic towns of Buda (the royal capital since the 15th century), Pest (the cultural centre) and Óbuda (built on the ancient Roman settlement of Aquincum). The city is bisected by the River Danube, which makes Budapest a natural geographical centre and a major international transport hub. Budapest has a rich and fascinating history, a vibrant cultural heritage, yet it managed to maintain its magic and charm. It has also been called the City of Spas with a dozen thermal bath complexes served by over a hundred natural thermal springs.
    http://etaps08.mit.bme.hu/


  • gcov—a Test Coverage Program

    2008-4-21

    gcov is a tool you can use in conjunction with GCC to test code coverage in your programs.
    http://gcc.gnu.org/onlinedocs/gcc/Gcov.html
    覆盖率(白盒测试)
    一、安装工作:
        ubuntu7.10源中有,但还要装libbfd-2.17.50.20070426.so,把它放到/usr/lib下。
    二、功能应用:
        [gcov命令行式的,ggcov(GTK图形式的)]
    fuqiang@fuqiang-laptop:~/linuxcexample/time/gcovex$ gcov
    用法:gconv [选项]... 源文件

    显示代码覆盖信息。

      -h, --help                      打印此帮助并退出
      -v, --version                    打印版本号并退出
      -a, --all-blocks                显示每个基本块的信息
      -b, --branch-probabilities      输出包含分支概率
      -c, --branch-counts             给出跳转的分支数,而不是百分比
      -n, --no-output                 不创建输出文件
      -l, --long-file-names           为包含进来的源文件使用长输出文件名
      -f, --function-summaries        输出每个函数的小结信息
      -o, --object-directory DIR|FILE 在 DIR 中搜索目标文件,或搜索名为 FILE 的目标文件
      -p, --preserve-paths            保留所有路径名
      -u, --unconditional-branches    同时显示无条件跳转数

    提交错误报告的具体步骤请参见:
    <URL:http://gcc.gnu.org/bugs.html>。

    For Debian GNU/Linux specific bug reporting instructions, please see:
    <URL:file:///usr/share/doc/gcc-4.1/README.Bugs>.
    fuqiang@fuqiang-laptop:~/linuxcexample/time/gcovex$ ls
    timeex.c
    fuqiang@fuqiang-laptop:~/linuxcexample/time/gcovex$ gcc -fprofile-arcs -ftest-coverage timeex.c
    fuqiang@fuqiang-laptop:~/linuxcexample/time/gcovex$ ls
    a.out  timeex.c  timeex.gcno
    fuqiang@fuqiang-laptop:~/linuxcexample/time/gcovex$ ./a.out
    biggest = Tue Jan 19 03:14:07 2038
    fuqiang@fuqiang-laptop:~/linuxcexample/time/gcovex$ ls
    a.out  timeex.c  timeex.gcda  timeex.gcno
    fuqiang@fuqiang-laptop:~/linuxcexample/time/gcovex$ ggcov timeex.c



  • different free software licenses

    2008-3-20

    The chart below helps illustrate some common compatibility relationships between different free software licenses:
    http://www.gnu.org/licenses/quick-guide-gplv3.html

  • 最基本linux c编程基础

    2008-3-15

    例子文件:
    /*
    this is bill.c
    */
    #include  <stdio.h>
    void  bill(char *argv)
    {
        printf("bill:  %s\n",argv);
    }
    /*
    this is linus.c
    */
    #include  <stdio.h>
    void  linus(char *argv)
    {
        printf("linus:  %s\n",argv);
    }
    /*
    this is mylib.h
    */
    void bill(char  *);
    void linus(char *);
    /*
    this is main program
    */
    #include  "mylib.h"
    int main()
    {
        linus("Hello Word");
        exit(0);
    }
    fuqiang@fuqiang-laptop:~/linuxcexample/ch1$ gcc -c bill.c linus.c
    fuqiang@fuqiang-laptop:~/linuxcexample/ch1$ ls *.o
    bill.o  linus.o
    fuqiang@fuqiang-laptop:~/linuxcexample/ch1$ ls
    bill.c  bill.o  linus.c  linus.o  main.c  mylib.h
    fuqiang@fuqiang-laptop:~/linuxcexample/ch1$ gcc -c main.c
    fuqiang@fuqiang-laptop:~/linuxcexample/ch1$ ls
    bill.c  bill.o  linus.c  linus.o  main.c  main.o  mylib.h
    fuqiang@fuqiang-laptop:~/linuxcexample/ch1$ gcc -o main main.o linus.o
    fuqiang@fuqiang-laptop:~/linuxcexample/ch1$ ./main
    linus:  Hello Word
    fuqiang@fuqiang-laptop:~/linuxcexample/ch1$ ar crv libmy.a  bill.o linus.o
    a - bill.o
    a - linus.o
    fuqiang@fuqiang-laptop:~/linuxcexample/ch1$ ls
    bill.c  bill.o  libmy.a  linus.c  linus.o  main  main.c  main.o  mylib.h
    fuqiang@fuqiang-laptop:~/linuxcexample/ch1$ ls libmy.a
    libmy.a
    fuqiang@fuqiang-laptop:~/linuxcexample/ch1$ nm main
    080494dc d _DYNAMIC
    080495b0 d _GLOBAL_OFFSET_TABLE_
    080484a8 R _IO_stdin_used
            w _Jv_RegisterClasses
    080494cc d __CTOR_END__
    080494c8 d __CTOR_LIST__
    080494d4 d __DTOR_END__
    080494d0 d __DTOR_LIST__
    080484c4 r __FRAME_END__
    080494d8 d __JCR_END__
    080494d8 d __JCR_LIST__
    080495d8 A __bss_start
    080495cc D __data_start
    08048460 t __do_global_ctors_aux
    08048350 t __do_global_dtors_aux
    080495d0 D __dso_handle
            w __gmon_start__
    0804845a T __i686.get_pc_thunk.bx
    080494c8 d __init_array_end
    080494c8 d __init_array_start
    080483f0 T __libc_csu_fini
    08048400 T __libc_csu_init
            U __libc_start_main@@GLIBC_2.0
    080495d8 A _edata
    080495dc A _end
    08048488 T _fini
    080484a4 R _fp_hw
    0804829c T _init
    08048320 T _start
    080495d8 b completed.5982
    080495cc W data_start
            U exit@@GLIBC_2.0
    08048380 t frame_dummy
    080483d0 T linus
    080483a4 T main
    080495d4 d p.5980
            U printf@@GLIBC_2.0
    fuqiang@fuqiang-laptop:~/linuxcexample/ch1$ nm libmy.a

    bill.o:
    00000000 T bill
            U printf

    linus.o:
    00000000 T linus
            U printf
  • HAProxy

    2008-3-14

       HAProxy is a free, very fast and reliable solution offering high availability, load balancing, and proxying for TCP and HTTP-based applications. It is particularly suited for web sites crawling under very high loads while needing persistence or Layer7 processing. Supporting tens of thousands of connections is clearly realistic with todays hardware. Its mode of operation makes its integration into existing architectures very easy and riskless, while still offering the possibility not to expose fragile web servers to the Net, such as below :

    Currently, two major versions are supported :

    • version 1.1 - maintains critical sites online since 2002
      The most stable and reliable, has reached years of uptime. Receives no new feature, dedicated to mission-critical usages only.
    • version 1.2 - opening the way to very high traffic sites
      The same as 1.1 with some new features such as poll/epoll support for very large number of sessions, IPv6 on the client side, application cookies, hot-reconfiguration, advanced dynamic load regulation, TCP keepalive, source hash, weighted load balancing, rbtree-based scheduler, and a nice Web status page. This code is still evolving but has significantly stabilized since 1.2.8.

    Additionally, a third version 1.3 is under active development. New features include :

    • Content Switching : provides ability to select a group of server based on any part of the request such as the URI, the Host field, cookies, or anything else. There is a growing request for this feature from large sites which separate dynamic and static contents.
    • Full Transparent Proxy : it is possible connect to the server with the Client's IP address or even any other IP address. This is possible only on Linux 2.4/2.6 with the cttproxy patch. This feature also makes it possible to transparently handle part of the traffic for a particular server without changing any server's address.
    • New faster tree-based scheduler : versions up to 1.2.16 required that all timeouts were set to the same value to support tens of hundreds of connections at full speed. With this new scheduler, it is no longer the case. I have backported it to 1.2.17.
    • Kernel TCP splicing : avoiding kernel-to-user then user-to-kernel data copies improves bandwidth and lowers CPU usage. Haproxy 1.3 supports Linux L7SW in order to achieve multi-gigabit performance on commodity hardware.
    • Connection Tarpitting : since the cost of maintaining a connection open is low, it is sometimes desirable to "tarpit" attack bots, which means maintain their connections open to limit their capacity. This has been developped for a site crawling under a small DDoS with easily identifiable requests from a few thousand zombies.
    • Finer Header Processing : will make it easier to write header-based rules and to process parts of the URI.
    • Very Fast and reliable Header Parsing : full parsing and indexing of an average request typically takes less than 2 microseconds with fully RFC2616-compliant integrity checks.
    • Modular Design : allow more people to contribute to the project and make it easier to debug. The pollers have been split, already making their development a lot easier. Other subsystems will be modularized soon.
    • Speculative I/O processing : try to access data on a socket before being notified about its readiness. The poller just speculates about what should be available and what should not, tries to guess, and if it wins, several expensive syscalls are saved. If it loses, those syscalls will have to be called anyway. A net overall gain of about 10% has been observed using Linux epoll().
    • ACLs : use any combination of any criterion as a condition to any action.
    • More load balancing algorithms : right now, Weighted Round Robin, Weighted Source Hash and Weighted URL Hash are implemented. Weighted Least Conns is pending. Other algorithms may come later such as Weighted Measured Response Time.

    Unlike other free "cheap" load-balancing solutions, this product is only used by a few hundreds of people around the world, but those people run very big sites serving several millions hits and between several tens of gigabytes to several terabytes per day to hundreds of thousands of clients. They need 24x7 availability and have internal skills to risk to maintain a free software solution. Often, the solution is deployed for internal uses and I only know about it when they send me some positive feedback or when they ask for a missing feature ;-)

    http://haproxy.1wt.eu/
  • python数据结构--->set(集合)

    2008-1-29

    主要了解集合的语义、组成、操作集、比较运算、集合的指令集、集合的内置函数与方法等信息。
    集合:相关数据对象集.

    Set Semantics

    A set is, perhaps the simplest possible container, since it contains objects in no particular order with no particular identification. Objects stand for themselves. With a sequence, objects are identified by position. With a mapping, objects are identified by some key. With a set, objects stand for themselves.

    Since each object stands for itself, elements of a set cannot be duplicated. A list or tuple, for example, can have any number of duplicate objects. For example, the tuple ( 1, 1, 2, 3 ) has four elements, which includes two copies of the integer 1; if we create a set from this tuple, the set will only have three elements.

    A set has large number of operations for unions, intersections, and differences. A common need is to examine a set to see if a particular object is a member of that set, or if one set is contained within another set.

    A set is mutable, which means that it cannot be used as a key for a dict for more information.) In order to use a set as a dict key, we can create a frozenset, which is an immutable copy of the original set. This allows us to accumulate a set of values to create a dict key.


    Set Literal Values

    frozenset (iterable) → set
    set( iterable) → set
    >>> set( ("hello", "world", "of", "words", "of", "world") )
    set(['world', 'hello', 'words', 'of'])

    Set Operations


    >>> fib=set( (1,1,2,3,5,8,13) )
    >>> prime=set( (2,3,5,7,11,13) )
    >>> fib | prime
    set([1, 2, 3, 5, 7, 8, 11, 13])
    >>> fib & prime
    set([2, 3, 5, 13])
    >>> fib - prime
    set([8, 1])
    >>> prime - fib
    set([11, 7])
    >>> fib ^ prime
    set([8, 1, 11, 7])

    Set Comparison Operators

    All of the standard comparisons (<, <=, >, >=, ==, !=, in, not in) work with sets
    >>> craps= set( [ (1,1), (2,1), (1,2), (6,6) ] )
    >>> (1,2) in craps
    True
    >>> (3,4) in craps
    False

    >>> three= set( [ (2,1), (1,2) ] )
    >>> three < craps
    True
    >>> three <= craps
    True
    >>> craps <= craps
    True
    >>> craps < craps
    False

    Set Statements


    >>> even= set( range(2,38,2) )
    >>> ōdd= set( range(1,37,2) )
    >>> zero= set( (0,'00') )
    >>> for n in even|odd|zero:
    print n
    0
    1
    2
    3
    4
    5
    6
    7
    8
    9
    10
    11
    12
    13
    14
    15
    16
    17
    18
    19
    20
    21
    22
    23
    24
    25
    26
    27
    28
    29
    30
    31
    32
    33
    34
    35
    36
    00

    Set Built-in Functions

    A number of built-in functions create or process sets.

    len(object ) → integer

    Return the number of items of a set.

    max(set ) → value

    With a set, return its largest item

    min(set ) → value

    With a set, return its smallest item.

    Set Methods

    A set object has a number of member methods. In the following definitions, s is a set object.

    The following transformation functions update a set.

    s.clear

    Remove all items from the set.

    s.copy → set

    Copy the set to make a new set. This is a shallow copy. All objects in the new set are references to the same objects as the original set.

    s.pop → object

    Remove an arbitrary object from the set, returning the object. If the set was already empty, this will raise a KeyError exception.

    s.add(new)

    Adds element new to the set. If the object is already in the set, nothing happens.

    s.remove(old)

    Removes element old from the set. If the object old is not in the set, this will raise a KeyError exception.

    s.discard(old)

    Removes element old from the set. If the object old is not in the set, nothing happens.

    s.update(new) → object

    Merge values from the new set into the original set, adding elements as needed. It is equivalent to the following Python statement. s |= new.

    s.intersection_update(new) → object

    Update s to have the intersection of s and new. In effect, this discards elements from s, keeping only elements which are common to new and s. It is equivalent to the following Python statement. s &= new.

    s.difference_update(new) → object

    Update s to have the difference between s and new. In effect, this discards elements from s which are also in new. It is equivalent to the following Python statement. s -= new.

    s.symmetric_difference_update(new) → object

    Update s to have the symmetric difference between s and new. In effect, this both discards elements from s which are common with new and also inserts elements into s which are unique to new. It is equivalent to the following Python statement. s ^= new.

    The following accessor methods provide information about a set.

    s.issubset(set) → boolean

    If s is a subset of set, return True, otherwise return False. Essentially, this is s <= set.

    s.issuperset(set) → boolean

    If s is a superset of set, return True, otherwise return False. Essentially, this is s >= set.

    s.union(new) → set

    If new is a proper set, return s | new. If new is a sequence or other iterable, make a new set from the value of new, then return the union, s | new. This does not update s.

    >>> prime.union( (1, 2, 3, 4, 5) )
    set([1, 2, 3, 4, 5, 7, 11, 13])
    s.intersection(new) → set

    If new is a proper set, return s & new. If new is a sequence or other iterable, make a new set from the value of new, then return the intersection, s & new. This does not update s.

    s.difference(new) → set

    If new is a proper set, return s - new. If new is a sequence or other iterable, make a new set from the value of new, then return the difference, s - new. This does not update s.

    s.symmetric_difference(new) → set

    If new is a proper set, return s ^ new. If new is a sequence or other iterable, make a new set from the value of new, then return the symmetric difference, s ^ new. This does not update s.

    >>>help(set)可查一下
    Help on class set in module __builtin__:

    class set(object)
     |  set(iterable) --> set object
     | 
     |  Build an unordered collection of unique elements.
     | 
     |  Methods defined here:
     | 
     |  __and__(...)
     |      x.__and__(y) <==> x&y
     | 
     |  __cmp__(...)
     |      x.__cmp__(y) <==> cmp(x,y)
     | 
     |  __contains__(...)
     |      x.__contains__(y) <==> y in x.
     | 
     |  __eq__(...)
     |      x.__eq__(y) <==> x==y
     | 
     |  __ge__(...)
     |      x.__ge__(y) <==> x>=y
    .............................




     


  • Graphical tools for ODBC management and browsing

    2008-1-26

       This package contains three graphical applications for use with
    unixODBC, the Open DataBase Connectivity suite: ODBCConfig, a graphical
    configuration tool for managing database drivers and access to
    individual databases; DataManager, a simple browser and query tool for
    ODBC databases; and odbctest, a tool for testing the ODBC API itself.

我的热点日志

  • gcov—a Test Coverage Program

    2008-4-21

    gcov is a tool you can use in conjunction with GCC to test code coverage in your programs.
    http://gcc.gnu.org/onlinedocs/gcc/Gcov.html
    覆盖率(白盒测试)
    一、安装工作:
        ubuntu7.10源中有,但还要装libbfd-2.17.50.20070426.so,把它放到/usr/lib下。
    二、功能应用:
        [gcov命令行式的,ggcov(GTK图形式的)]
    fuqiang@fuqiang-laptop:~/linuxcexample/time/gcovex$ gcov
    用法:gconv [选项]... 源文件

    显示代码覆盖信息。

      -h, --help                      打印此帮助并退出
      -v, --version                    打印版本号并退出
      -a, --all-blocks                显示每个基本块的信息
      -b, --branch-probabilities      输出包含分支概率
      -c, --branch-counts             给出跳转的分支数,而不是百分比
      -n, --no-output                 不创建输出文件
      -l, --long-file-names           为包含进来的源文件使用长输出文件名
      -f, --function-summaries        输出每个函数的小结信息
      -o, --object-directory DIR|FILE 在 DIR 中搜索目标文件,或搜索名为 FILE 的目标文件
      -p, --preserve-paths            保留所有路径名
      -u, --unconditional-branches    同时显示无条件跳转数

    提交错误报告的具体步骤请参见:
    <URL:http://gcc.gnu.org/bugs.html>。

    For Debian GNU/Linux specific bug reporting instructions, please see:
    <URL:file:///usr/share/doc/gcc-4.1/README.Bugs>.
    fuqiang@fuqiang-laptop:~/linuxcexample/time/gcovex$ ls
    timeex.c
    fuqiang@fuqiang-laptop:~/linuxcexample/time/gcovex$ gcc -fprofile-arcs -ftest-coverage timeex.c
    fuqiang@fuqiang-laptop:~/linuxcexample/time/gcovex$ ls
    a.out  timeex.c  timeex.gcno
    fuqiang@fuqiang-laptop:~/linuxcexample/time/gcovex$ ./a.out
    biggest = Tue Jan 19 03:14:07 2038
    fuqiang@fuqiang-laptop:~/linuxcexample/time/gcovex$ ls
    a.out  timeex.c  timeex.gcda  timeex.gcno
    fuqiang@fuqiang-laptop:~/linuxcexample/time/gcovex$ ggcov timeex.c



  • java字节码反编译软件

    2008-4-27

    reJ

    The reJ project aims to allow improved visibility into Java class files, whether they were created compiling from Java sources, another language or by any other kind of tool. Basically anything that will run in a Java Virtual Machine.

    reJ is a library and a graphical tool for inspection (viewing, searching and comparing) and manipulation (modification, obfuscation, refactoring of methods, fields, attributes and code) of classfiles for the Java platform.

    http://rejava.sourceforge.net/

    rejava

  • Welcome to XtreemOS!

    2008-4-27

    Building and Promoting a Linux-based Operating System to Support Virtual Organizations for Next Generation Grids (2006-2010).

    http://www.xtreemos.eu/

    The emergence of Grids enables the sharing of a wide range of resources to solve large-scale computational and data intensive problems in science, engineering and commerce.
    While much has been done to build Grid middleware on top of existing operating systems, little has been done to extend the underlying operating systems to enablee and facilitate Grid computing, for example by embedding important functionalities directly into the operating system kernel.
    The XtreemOS project aims at investigating and proposing new services that should be added to current operating systems to build Grid infrastructure in a simple way. XtreemOS targets the Linux well-accepted open source operating system extending it to Grid with native support for virtual organizations. One of the most important challenges in XtreemOS is the identification of the basic functionalities which are to be embedded in the Linux kernel.

    A set of operating system services, extending those found in the standard Linux distribution, will provide Linux users with all the Grid capabilities associated with current Grid middleware, but fully integrated into the OS. The underlying Linux OS will be extended as needed to support virtual organizations spanning across many machines and to supply appropriate interfaces to Grid OS services.

    Installed on each participating machine (personal computer, cluster of workstations, mobile devices), the XtreemOS system will provide for the Grid what a traditional Operating System offers for a single computer: abstraction from the hardware and secure resource sharing between different users. It will thus considerably ease the work of users belonging to virtual organizations giving them the illusion of using a traditional computer, and releasing them from dealing with the complex resource management issues of a typical Grid environment.  By integrating Grid capabilities into the Linux kernel, XtreemOS will also provide a more robust, secure and easier-to-manage infrastructure for system administrators. This will be experimentally demonstrated with a set of real applications, provided by well-known industrial partners, that cover a large spectrum of application fields.

  • ETAPS 2008

    2008-4-25

      researchers working on topics relating to Software Science. ETAPS, established in 1998, is a confederation of five main annual conferences, accompanied by satellite workshops and other events. ETAPS 2008 is the eleventh event in the series.
      ETAPS 2008 will be hosted by Budapest, the capital of Hungary, which was founded in 1873 as the unification of the separate historic towns of Buda (the royal capital since the 15th century), Pest (the cultural centre) and Óbuda (built on the ancient Roman settlement of Aquincum). The city is bisected by the River Danube, which makes Budapest a natural geographical centre and a major international transport hub. Budapest has a rich and fascinating history, a vibrant cultural heritage, yet it managed to maintain its magic and charm. It has also been called the City of Spas with a dozen thermal bath complexes served by over a hundred natural thermal springs.
    http://etaps08.mit.bme.hu/


  • Calendar of Upcoming Conferences(2008)

    2008-5-17

    June 22–27, 2008, in Boston, MA, for the 2008 USENIX Annual Technical Conference. Leading researchers from around the globe are coming together to discuss their innovative systems research and cutting-edge practices.
    http://www.usenix.org/events/
        About USENIX

    USENIX Mission Statement

    USENIX, the Advanced Computing Systems Association:

        * Fosters technical excellence and innovation
        * Supports and disseminates research with a practical bias
        * Provides a neutral forum for discussion of technical issues
        * Encourages computing outreach into the community at large

    Since 1975, the USENIX Association has brought together the community of engineers, system administrators, scientists, and technicians working on the cutting edge of the computing world.

    The USENIX conferences have become the essential meeting grounds for the presentation and discussion of the most advanced information on the developments of all aspects of computing systems.

    USENIX supports its members' professional and technical development through a variety of on-going activities, including:

        * Member benefits
        * Annual technical and system administration conferences
        * Informal, specific-topic conferences such as security, internet technology, and mobile computing—as many as nine technical conferences per year
        * A highly regarded tutorial program
        * SAGE, a Special Interest Group for system administrators
        * Student programs that include stipends to attend conferences, low student member fees, a university outreach program, and best paper awards
        * Online library with proceedings from each USENIX conference and the magazine, ;login:
        * Participation in various ISO, IEEE and Open Group standards efforts
        * USENIX supports a "Good Works" program.
        * International Programs, including an International Affiliate Program. USENIX also co-sponsors conferences by international technical groups.
        * Two prestigious annual Awards which recognize public service and technical excellence: The Lifetime Achievement (Flame) Award and The Software Tools Users Group Award. SAGE sponsors the annual SAGE Outstanding Achievement Award recognizing outstanding achievement in system administration.
        * Membership in the Computing Research Association and The Open Group
Open Toolbar