Kabushiki Kaisha Toshiba

The Sanwa Bank Limited

Financial Technology Research Institute, Inc.

Naoshi Uchihira

Satoshi Ito

Toshibumi Seki

Akihiko Ohsuga

Yasuyuki Tahara

Yasuo Nagai

Shinichi Honiden

Nobuyuki Sawashima

Keiichi Handa

Hideaki Shiotani

Takeichiro Nishikawa

Yoshikuni Matsumura

Keiji Ohmori

Makoto Miyoshi

Satoru Endo

Hiroshi Shirakawa

A host apparatus of a financial auction system is disposed in a site that is accessible from user terminal apparatuses through the transmission line of a network. The host apparatus has a borrowing agent serving as the window for a potential borrower, a lending agent serving as the window for a potential lender, a screening section for extracting a potential lending offer matching a predetermined condition, a matchmaking section for selecting a successful bid from potential lending offers, and an information collection section for collecting background information of a potential borrowing request. A database is attached to the host apparatus, where a borrowing request file, lending offer file, and background information file are formed.

Auction system and method

An apparatus for supporting parallelization according to the invention is characterized by comprising a serialization unit for converting a first concurrent program having a concurrent structure into a sequential program capable of being sequentially executed, a debugging unit for debugging the sequential program and forming debugging information, and a concurrent program programming unit for performing parallelization of the debugged sequential program on the basis of the debugging information to convert the sequential program into a second concurrent program. With above configuration, the debugging unit includes a unit for introducing information associated with concurrency to the sequential program.

Programming method for concurrent programs and program supporting apparatus thereof

A designer creates a program with the editor 1. The division means 2 divides each process of the program into a plurality of controllable sections. The detection means 3 finds the dependency relations among the sessions of the program. The generation means 4 represents as a scenario all the possible execution sequences of the sections in each process. When the designer selects the edge of a section to be executed first at each branch in the scenario with the use of the selection means 6, a scenario containing only the combinations of intended execution sequences is generated. Based on this scenario, the conversion means 9 inserts execution timing control instructions into the first program to convert the first program to a second program. The resulting second program does not contain a harmful nondeterminism. Therefore, a hyper sequential programming system or method for developing reliable concurrent programs is provided easily.

System for assisting a programmer find errors in concurrent programs

Programming method for concurrent programs and program supporting

Growing community of inventors

Kawasaki, Japan

Naoshi Uchihira